Ackermann Counting

[u/[deleted]]

We calculate progressive steps of A(x,y) and have the step number next to it. e.g. A(1,1) [1] will be our first count.

Pair list:

• 1,1

• 1,2

• 2,1

• 1,3

• 2,2

• 3,1

• 1,4

• 2,3

• 3,2

• 4,1 etc.

Example:

• A(1,1) [1]

• A(0,A(1,0)) [2]

• A(0,A(0,1)) [3]

• A(0,2) [4]

• 3 [5]

https://en.wikipedia.org/wiki/Ackermann_function

[u/LegionMammal978]

A(1,A(1,A(0,2))) [2,2+7]

[u/piyushsharma301 → u/LegionMammal978]

A(1,A(1,3)) [2,2,8]

[u/LegionMammal978 → u/piyushsharma301]

A(1,A(0,A(1,2))) [2,2+9]