Collection of small, self-contained Cuneiform code examples.

Program computing the Ackermann-Péter function defined as

```
| n+1 if m = 0
A(m,n) = | A(m-1,1) if m > 0 and n = 0
| A(m-1,A(m,n-1)) if m > 0 and n > 0
```

Prints the integers from 1 to 100 inclusive. But for multiples of 3 it prints Fizz, for multiples of 5 it prints Buzz and for multiples of both 3 and 5 it prints FizzBuzz.

This program is available with foreign functions in Matlab, Octave and Python.