Question

Ackerman's function is defined recursively on the nonnegative integers as follows:a(m, n) = n + 1 if m = 0a(m, n) = a(m-1, 1) if m ≠ 0, n = 0a(m, n) = a(m-1, a(m, n-1)) if m ≠ 0, n ≠ 0Using the above definition, show that a(2,2) equals 7.

Answer 1

The Following Ackerman's function has been converted into the tablular form so you can use as a reference for the below solution.