Ackermanns function1 , mapping N2 to N, is a recursive function that grows very rapidly
Chapter 5, Problem 42(choose chapter or problem)
Ackermanns function1 , mapping N2 to N, is a recursive function that grows very rapidly. It is given by A(0, n) = n + 1 for all n [ N A(m, 0) = A(m 1, 1) for all m [ N, m > 0 A(m, n) = A(m 1, A(m, n 1)) for all m [ N, n [ N, m > 0, n > 0 a. Compute (show all steps) the value of A(1, 1). b. Compute (show all steps) the value of A(2, 1). c. The value of A(4, 0) = 13 = 222 3, still a small value. But A(4,1) = 2222 3. Compute this value. d. Write a likely expression for the value of A(4, 2)
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer