Problem Statement

The Ackermann function is a classic example of a recursive function, notable especially because it is not a primitive recursive function. It grows very quickly in value, as does the size of its call tree.

The Ackermann function is usually defined as follows:

Its arguments are never negative and it always terminates.

Write a function which returns the value of

A ( m , n )

{\displaystyle A(m,n)}

. Arbitrary precision is preferred (since the function grows so quickly), but not required.

Let's start with the solution:

П1	<->	П0	ПП	06	С/П	ИП0	x=0	13	ИП1
1	+	В/О	ИП1	x=0	24	ИП0	1	П1	-
П0	ПП	06	В/О	ИП0	П2	ИП1	1	-	П1
ПП	06	П1	ИП2	1	-	П0	ПП	06	В/О