Extremely Deep Recursion - Ackermann

Computer Science Level 2

The Ackermann function is a computable function which grows very, very quickly as its inputs grow. For example, while \( A(1,2),\) \(A (2,2),\) and \(A(3,2) \) are equal to \(4,7,\) and \(29,\) respectively, \( A(4,2) \approx 2 \times 10^{19728} \).

The Ackermann function can be defined as follows: \[ A(m,n) = \begin{cases} n+1 & \mbox{if } m = 0 \\ A(m-1, 1) & \mbox{if } m > 0 \mbox{ and } n = 0 \\ A(m-1, A(m, n-1)) & \mbox{if } m > 0 \mbox{ and } n > 0. \end{cases} \]

What is the value of \( A(3,6)? \)

Excel in math and science

Master concepts by solving fun, challenging problems.

It's hard to learn from lectures and videos

Learn more effectively through short, interactive explorations.

Used and loved by over 5 million people

Learn from a vibrant community of students and enthusiasts, including olympiad champions, researchers, and professionals.