Chapter 13, Problem 6PE

Ackermann’s Function

7. Ackermann’s Function is a recursive mathematical algorithm that can be used to test how well a computer performs recursion. Design a function ackermann (m, n), which solves Ackermann’s Function. Use the following logic in your function:

If m = 0 then return n + 1

If n = 0 then return ackermann(m – 1, 1)

Otherwise, return ackermann(m – 1, ackermann(m, n – 1))