Ackermann’s function using Dynamic programming
Given two nonzero integers M and N, the problem is to compute the result of the Ackermann function based on some particular equations.
Examples:
Input: M = 2, N = 2
Output: 7Input: M = 2, N = 7
Output: 6141004759
The approach for Ackermann function described in this article, takes a very huge amount of time to compute the value for even small values of (M, N) or in most cases doesn’t result in anything.
Dynamic Programming approach:
Here are the following Ackermann equations that would be used to come up with efficient solution.
A(m, n) = A(m1, A(m, n1)) —– (Eq 1)
A(0, n) = n+1 —– (Eq 2)
A(m, 0) = A(m1, 1) —– (Eq 3)
Let’s assume the value of m = 2 and n = 2
A 2d DP table of size ( (m+1) x (n+1) ) is created for storing the result of each subproblem.
Following are the steps demonstrated to fill up the table.
 Empty Table – Initial Step

Filled using A ( 0, n ) = n + 1
The very next method is to fill all the base values, by taking the help of equation2. 
In the next step the whole 1st row would be filled,

A ( 1, 0 ) = A ( 0, 1 ) —– (refer Eq (3))
Since A ( 0, 1 ) = 2
Therefore, A ( 1, 0 ) = 2 —–(Eq 4) 
A ( 1, 1 ) = A ( 0, A ( 1, 0 ) ) —– refer Eq (1)
= A ( 0, 2 ) —– refer Eq (4)
= 3 —– refer Eq (2)
So, A ( 1, 1 ) = 3 —–(Eq 5) 
A ( 1, 2 ) = A ( 0, A ( 1, 1 ) ) —– refer equation (1)
= A ( 0, 3 ) —– refer equation (5)
= 4 —– refer equation (2)
So, A ( 1, 2 ) = 4 —–(Eq 6)

 Fill the table using equations and stored values
Let’s just fill the first column of the last row i.e (2, 0) in the same manner as above, because for the other two columns there are some unsolved values.
A ( 2, 0 ) = A ( 1, 1 ) —– refer equation (3)
A ( 1, 1 ) = 3
So, A ( 2, 0 ) = 3 —– (Eq. 7) 
Solving for A ( 2, 1 ) and A ( 2, 2 ).
For simplicity the process for solving above functions is divided into two steps,
 In the first one, the problem is identified.
A ( 2, 1 ) = A ( 1, A ( 2, 0 ) ) —– refer equation (1)
A ( 2, 0 ) = 3
A ( 2, 1 ) = A ( 1, 3 )So to compute this value, again use equation (1)
A ( 1, 3 ) = A ( 0, A ( 1, 2 ) )
A ( 1, 2 ) = 4
A ( 1, 3 ) = A ( 0, 4 ) —– refer equation(2)
= 5Therefore A ( 2, 1 ) = A ( 1, 3 ) = 5 — (Eq 7)
 In the next one, methodology is described in detail and a generic formula is obtained to be logical while being used in program
Let’s solve A ( 2, 2 ) , with a theory upfront
A ( 2, 2 ) = A ( 1, A ( 2, 1 ) ) —– refer equation (1)
A ( 2, 1) = 5
A ( 2, 2 ) = A ( 1, 5 )To compute A(1, 5) in a generic manner, observe how it reduces itself!
A ( 1, 5 ) = A ( 0, A ( 1, 4 ) )
A ( 1, 4 ) = A( 0, A ( 1, 3 ) )
A ( 1, 3 ) = A ( 0, A ( 1, 2 ) )
A ( 1, 2 ) = 4Returning back from the function we get,
A ( 1, 3 ) = A ( 0, 4 ) = 5 —– refer equation (2)
A ( 1, 4 ) = A ( 0, A (1, 3 ) ) = A ( 0, 5 ) = 6 —–Since A ( 1, 3 ) = 5
A ( 1, 5 ) = A ( 0, A ( 1, 4 ) ) = A ( 0, 6 ) = 7
So, A ( 2, 2 ) = 7 —— (Eq 9)
Important Points:
(n = column number, c: ( any number > n), r: row number]
1 . A ( 1, c ) = A ( 1, n ) + ( c – n ) From the Above Observation
2 . A ( r, c ) = A ( r, n ) + ( c – n )*r Based on hand tracing
 In the first one, the problem is identified.
 Final Table with result of each subproblem
Below is the implementation of the above approach:
Python3
# Python code for the above approach # Bottum Up Approach def Ackermann(m, n): # creating 2D LIST cache = [[ 0 for i in range (n + 1 )] for j in range (m + 1 )] for rows in range (m + 1 ): for cols in range (n + 1 ): # base case A ( 0, n ) = n + 1 if rows = = 0 : cache[rows][cols] = cols + 1 # base case A ( m, 0 ) = # A ( m1, 1) [Computed already] elif cols = = 0 : cache[rows][cols] = cache[rows  1 ][ 1 ] else : # if rows and cols > 0 # then applying A ( m, n ) = # A ( m1, A ( m, n1 ) ) r = rows  1 c = cache[rows][cols  1 ] # applying equation (2) # here A ( 0, n ) = n + 1 if r = = 0 : ans = c + 1 elif c < = n: # using stored value in cache ans = cache[rows  1 ][cache[rows][cols  1 ]] else : # Using the Derived Formula # to compute mystery values in O(1) time ans = (c  n) * (r) + cache[r][n] cache[rows][cols] = ans return cache[m][n] # very small values m = 2 n = 2 # a bit higher value m1 = 5 n1 = 7 print ( "Ackermann value for m = " , m, " and n = " , n, "is > " , Ackermann(m, n)) print ( "Ackermann value for m = " , m1, " and n = " , n1, "is > " , Ackermann(m1, n1)) 
Ackermann value for m = 2 and n = 2 is > 7
Ackermann value for m = 5 and n = 7 is > 6141004759
Time complexity: O( M * N )
Auxiliary Space complexity: O( M * N )
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a studentfriendly price.
Recommended Posts:
 Bitmasking and Dynamic Programming  Set2 (TSP)
 Dynamic Programming on Trees  Set 2
 Dynamic Programming on Trees  Set1
 Double Knapsack  Dynamic Programming
 Greedy approach vs Dynamic programming
 Dynamic Programming  Building Bridges
 Top 20 Dynamic Programming Interview Questions
 Number of Unique BST with a given key  Dynamic Programming
 Dynamic Programming vs DivideandConquer
 Convert N to M with given operations using dynamic programming
 How to solve a Dynamic Programming Problem ?
 Optimal Substructure Property in Dynamic Programming  DP2
 Overlapping Subproblems Property in Dynamic Programming  DP1
 Compute nCr % p  Set 1 (Introduction and Dynamic Programming Solution)
 Python  Implementing Dynamic programming using Dictionary
 Longest subsequence with a given OR value : Dynamic Programming Approach
 Distinct palindromic substrings of the given string using Dynamic Programming
 Understanding The Coin Change Problem With Dynamic Programming
 Optimal Strategy for the Divisor game using Dynamic Programming
 Minimum time required to rot all oranges  Dynamic Programming
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.