Question: Ackermanns function is defined as follows: A(0,n) = n + 1 for n>=0 A(m,0) = A (m-1,1) for m > 0 A(m,n) = A(m-1,A(m,n-1)) for
Ackermanns function is defined as follows:
A(0,n) = n + 1 for n>=0
A(m,0) = A (m-1,1) for m > 0
A(m,n) = A(m-1,A(m,n-1)) for m > 0 and n > 0
Write a recursive function to calculate Ackermanns function.
Calculate the following. If it is impossible to calculate some of them, explain why.
A(0,0) A(0,9) A(1,8) A(2,2) A(2,0) A(2,3) A(3,2) A(4,2) A(4,3) A(4,0)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
