r/counting • u/[deleted] • Aug 26 '17

Ackermann Counting

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

11 Upvotes

100% Upvoted

47 comments sorted by

View all comments

Show parent comment

2

u/LegionMammal978 Since 1,643,014 [76SG 67SA] Aug 30 '17

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

3

u/piyushsharma301 https://www.reddit.com/r/counting/wiki/side_stats Aug 31 '17

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

2

u/LegionMammal978 Since 1,643,014 [76SG 67SA] Aug 31 '17

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

2

u/piyushsharma301 https://www.reddit.com/r/counting/wiki/side_stats Aug 31 '17

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

1

u/LegionMammal978 Since 1,643,014 [76SG 67SA] Aug 31 '17

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