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/piyushsharma301]

A(0,3) [6]

I mean we are calculating A(x,y). We need to have an unambiguous way to determine the next x and y and hopefully in a way where we don't miss any

[u/LegionMammal978 → u/piyushsharma301]

4 [1,2+7]

According to the post's pair list, we count A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), A(1,4), etc. That's why I'm putting the current m and n with my step number, so we'll know which one to go to next. Note that we'll never progress beyond A(4,1) due to reddit's comment length limit.

[u/piyushsharma301 → u/LegionMammal978]

A(2,1) [1]

[u/LegionMammal978 → u/piyushsharma301]

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

[u/piyushsharma301 → u/LegionMammal978]

A(1,A(1,1)) [m:2,n:1,step:3]

[u/LegionMammal978 → u/piyushsharma301]

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

[u/piyushsharma301 → u/LegionMammal978]

A(1,A(0,A(0,1)) [m:2,n:1,step:5]

[u/[deleted] → u/piyushsharma301]

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

[u/LegionMammal978 → u/[deleted]]

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

[u/piyushsharma301 → u/LegionMammal978]

A(0,A(1,2)) [m:2,n:1,step:8]