In recursion theory, the Ackermann function or Ackermann-Péter function is a simple example of a general recursive function that is not primitive recursive. The general recursive functions is also known as the computable functions. The set of primitive recursive functions is a subset of the set of general recursive functions. Ackermann's function is an example that shows that it is a strict subset.

It takes two natural numbers as arguments and yields another natural number, using the notation A(m,n). Its value grows rapidly; even for small inputs, for example A(4,2)^[1] and A(4,3), the results are large numbers. These large numbers in the m=4 row can also be expressed using tetrations.

History

In the late 1920s, the mathematicians Gabriel Sudan and Wilhelm Ackermann, students of David Hilbert, were studying the foundations of computation. Sudan is credited with inventing the lesser-known Sudan function, the first published function that is recursive but not primitive recursive. Shortly afterwards and independently, in 1928, Ackermann published his own recursive but not primitive recursive function.^[2]

Ackermann originally considered a function A(m, n, p) of three variables, the p-fold iterated exponentiation of m with n, or m → n → p as expressed using the Conway chained arrow notation. When p = 1, this is mⁿ, which is m multiplied by itself n times. When p = 2, it is the double exponentiation , and with p > 2, it is a tower of exponents with n levels, or m raised n times to the power m also written as ⁿm, the tetration of m with n. We can continue to generalize this indefinitely as p becomes larger.

Ackermann proved that A is a recursive function, a function a computer with unbounded memory can calculate, but it is not a primitive recursive function, a class of functions including almost all familiar functions such as addition and factorial.

In On the Infinite, David Hilbert hypothesized that the Ackermann function was not primitively recursive, but it was Ackermann, Hilbert’s personal secretary and former student, who actually proved the hypothesis in his paper On Hilbert’s Construction of the Real Numbers. On the Infinite was Hilbert’s most important paper on the foundations of mathematics, serving as the heart of Hilbert's program to secure the foundation of transfinite numbers by basing them on finite methods.^[3][4]

A similar function of only two variables was later defined by Rózsa Péter and Raphael Robinson; its definition is given below. The numbers, except in the first few rows, are three less than powers of two. For the exact relation between the two functions, see below.^[5]

Definition and properties

The Ackermann function is defined recursively for non-negative integers m and n as follows (this presentation is due to Rózsa Péter):



It may not be immediately obvious that the evaluation of these functions always terminates. The recursion is bounded because in each recursive application either m decreases, or m remains the same and n decreases. Each time that n reaches zero, m decreases, so m eventually reaches zero as well. (Expressed more technically, in each case the pair (m, n) decreases in the lexicographic order, which preserves the well-ordering of the non-negative integers.) However, when m decreases there is no upper bound on how much n can increase — and it will often increase greatly.

The Ackermann function can also be expressed nonrecursively using:

• Conway chained arrow notation:

:A(m, n) = (2 → (n+3) → (m − 2)) − 3 for m > 2

hence

:2 → n → m = A(m+2,n-3) + 3 for n>2

(n=1 and n=2 would correspond with A(m,−2) = −1 and A(m,−1) = 1, which could logically be added.)

• hyper operators:

:A(m, n) = hyper(2, m, n + 3) − 3

• the indexed version of Knuth's up-arrow notation:

:A(m, n) =

The part of the definition A(m, 0) = A(m-1, 1) corresponds to .

For small values of m like 1, 2, or 3, the Ackermann function grows relatively slowly with respect to n (at most exponentially). For m ≥ 4, however, it grows much more quickly; even A(4, 2) is about 2×10¹⁹⁷²⁸, and the decimal expansion of A(4, 3) is very large by any typical measure.

If we define the function f (n) = A(n, n), which increases both m and n at the same time, we have a function of one variable that dwarfs every primitive recursive function, including very fast-growing functions such as the exponential function, the factorial function, multi- and superfactorial functions, and even functions defined using Knuth's up-arrow notation (except when the indexed up-arrow is used).

This extreme growth can be exploited to show that f, which is obviously computable on a machine with infinite memory such as a Turing machine and so is a computable function, grows faster than any primitive recursive function and is therefore not primitive recursive. Though the Ackermann function is often used to debunk the hypothesis that all useful or simple functions are primitive recursive, one should not confuse the primitive recursive functions with those definable by primitive recursion (it is this latter class that is of interest to programming language theorists because programs written using only primitive recursion are guaranteed to terminate). In a category with exponentials, using the isomorphism , the Ackermann function may be defined via primitive recursion over higher-order functionals as follows:



where Succ is the usual successor function and Iter is defined by primitive recursion as well:



Another interesting class of functions are the Busy beaver functions, which grow faster than any recursive function, and indeed it can be shown that if they could be evaluated in general, we could solve the halting problem so evaluation using an algorithm is impossible.

One interesting aspect of the Ackermann function is that the only arithmetic operations it ever uses are addition and subtraction of 1. Its properties come solely from the power of unlimited recursion. This also implies that its running time is at least proportional to its output, and so is also extremely huge. In actuality, for most cases the running time is far larger than the output; see below.

Table of values

Computing the Ackermann function can be restated in terms of an infinite table. We place the natural numbers along the top row. To determine a number in the table, take the number immediately to the left, then look up the required number in the previous row, at the position given by the number just taken. If there is no number to its left, simply look at column 1 in the previous row. Here is a small upper-left portion of the table:

Values of A(m, n)

m\n	0	1	2	3	4	n
0	1	2	3	4	5
1	2	3	4	5	6
2	3	5	7	9	11
3	5	13	29	61	125
4	13	65533	265536 − 3		A(3, A(4, 3))
5	65533	A(4, 65533)	A(4, A(5, 1))	A(4, A(5, 2))	A(4, A(5, 3))	A(4, A(5, n-1))
6	A(5, 1)	A(5, A(6, 0))	A(5, A(6, 1))	A(5, A(6, 2))	A(5, A(6, 3))	A(5, A(6, n-1))

The numbers listed here in a recursive reference are very large and cannot be easily notated in some other form.

Despite the large values occurring in this early section of the table, some even larger numbers have been defined, such as Graham's number, which cannot be written with any small number of Knuth arrows. This number is constructed with a technique similar to applying the Ackermann function to itself recursively.

This is a repeat of the above table, but with the values replaced by the relevant expression from the function definition to show the pattern clearly:

Values of A(m, n)

m\n	0	1	2	3	4	n
0	0+1	1+1	2+1	3+1	4+1
1	A(0,1)	A(0,A(1,0))	A(0,(A(1,1))	A(0,(A(1,2))	A(0,(A(1,3))
2	A(1,1)	A(1,(A(2,0))	A(1,(A(2,1))	A(1,(A(2,2))	A(1,(A(2,3))
3	A(2,1)	A(2,(A(3,0))	A(2,(A(3,1))	A(2,(A(3,2))	A(2,(A(3,3))
4	A(3,1)	A(3,(A(4,0))	A(3,(A(4,1))	A(3,(A(4,2))	A(3,(A(4,3))
5	A(4,1)	A(4,(A(5,0))	A(4,(A(5,1))	A(4,(A(5,2))	A(4,(A(5,3))	A(4, A(5, n-1))
6	A(5,1)	A(5,(A(6,0))	A(5,(A(6,1))	A(5,(A(6,2))	A(5,(A(6,3))	A(5, A(6, n-1))

Expansion

To see how the Ackermann function grows so quickly, it helps to expand out some simple expressions using the rules in the original definition. For example, we can fully evaluate in the following way:

To demonstrate how 's computation results many steps and in a large number:

We stop here because is which is a short expression that still represents a large number. According to the formula for A(3,n) in the table above, the plus and minus three cancel out and the end result uses which is then, itself raised as a power of 2 and then 3 subtracted to obtain the final result, which is a vastly larger number yet.

Inverse

Since the function  f (n) = A(n, n) considered above grows very rapidly, its inverse function, f⁻¹, grows very slowly. This inverse Ackermann function f⁻¹ is usually denoted by α. In fact, α(n) is less than 5 for any conceivable input size n, since A(4, 4) is a large number. "For all practical purposes", α(n) can be regarded as being a constant.

This inverse appears in the time complexity of some algorithms, such as the disjoint-set data structure and Chazelle's algorithm for minimum spanning trees. Sometimes Ackermann's original function or other variations are used in these settings, but they all grow at similarly high rates. In particular, some modified functions simplify the expression by eliminating the −3 and similar terms.

A two-parameter variation of the inverse Ackermann function can be defined as follows:

This function arises in more precise analyses of the algorithms mentioned above, and gives a more refined time bound. In the disjoint-set data structure, m represents the number of operations while n represents the number of elements; in the minimum spanning tree algorithm, m represents the number of edges while n represents the number of vertices. Several slightly different definitions of α(m, n) exist; for example, log₂ n is sometimes replaced by n, and the floor function is sometimes replaced by a ceiling.

Other studies might define an inverse function of one where m is set to a constant, such that the inverse applies to a particular row.^[6]

Use as benchmark

The Ackermann function, due to its definition in terms of extremely deep recursion, can be used as a benchmark of a compiler's ability to optimize recursion. The first use of Ackermann's function in this way was by Y. Sundblad, The Ackermann function. A Theoretical, computational and formula manipulative study. (BIT 11 (1971), 107119).

This seminal paper was taken up by Brian Wichmann (co-author of the Whetstone benchmark) in a trilogy of papers written between 1975 and 1982.^[7][8][9]

A more recent use of Ackermann's function as a compiler benchmark is in The Computer Language Shootout which compares the time required to evaluate this function for fixed arguments in many different programming language implementations.^[10][11]

For example, a compiler which, in analyzing the computation of A(3, 30), is able to save intermediate values like the A(3, n) and A(2, n) in that calculation rather than recomputing them, can speed up computation of A(3, 30) by a factor of hundreds of thousands. Also, if A(2, n) is computed directly rather than as a recursive expansion of the form A(1, A(1, A(1,...A(1, 0)...))), this will save significant amounts of time. Computing A(1, n) takes linear time in n. Computing A(2, n) requires quadratic time, since it expands to O(n) nested calls to A(1, i) for various i. Computing A(3, n) requires time proportionate to 4ⁿ⁺¹. The computation of A(3, 1) in the example above takes 16 (4²) steps.

A(4, 2), which appears as a decimal expansion in several web pages, cannot possibly be computed by simple recursive application of the Ackermann function in any tractable amount of time. Instead, shortcut formulas such as A(3, n) = 8×2ⁿ−3 are used as an optimization to complete some of the recursive calls.

A practical method of computing functions similar to Ackermann's is to use memoization of intermediate results. A compiler could apply this technique to a function automatically using Donald Michie's "memo functions".^[12]

Implementations

The first implementation in a programming language was in Fortran in 1964, see H. Gordon Rice^[13], Recursion and iteration, Commun. ACM, 8(2), 1965, pp. 114--115.)

In Scheme:

(define (ackermann m n) (cond ((= m 0) (+ 1 n)) ((= n 0) (ackermann (- m 1) 1)) ((> n 0) (ackermann (- m 1) (ackermann m (- n 1))))))

In Haskell:

ackermann 0 n = (n + 1) ackermann m 0 = ackermann (m-1) 1 ackermann m n = ackermann (m-1) (ackermann m (n-1))

In ML:

fun ackermann (0,n) = n + 1 | ackermann (m,0) = ackermann (m-1, 1) | ackermann (m,n) = ackermann (m-1, ackermann (m, n-1));

In Ocaml:

let rec ackermann = function (0, n) -> n + 1 | (m, 0) -> ackermann (m-1, 1) | (m, n) -> ackermann (m-1, ackermann (m, n-1))

In C:

int ackermann(int m, int n) { if (m == 0) return n+1; else if (m > 0 && n == 0) return ackermann(m-1, 1); else if (m > 0 && n > 0) return ackermann(m-1, ackermann(m, n-1)); }

In Python:

def ackermann(m, n): if m == 0: return n+1 elif m > 0 and n == 0: return ackermann(m-1, 1) elif m > 0 and n > 0: return ackermann(m-1, ackermann(m, n-1))

In Perl:

sub ackermann { my($m, $n) = @_; return $n+1 if $m == 0; return ackermann($m-1, 1) if $m > 0 && $n == 0; return ackermann($m-1, ackermann($m, $n-1)) if $m > 0 && $n > 0; }

In Ruby:

def ackermann(m,n) if m==0 n+1 elsif m > 0 && n==0 ackermann(m-1,1) elsif m > 0 && n > 0 ackermann(m-1,ackermann(m,n-1)) end end

In Java:

public static int ackermann(int m, int n) { if (m == 0) return n+1; else if (m > 0 && n == 0) return ackermann(m-1, 1); else return ackermann(m-1, ackermann(m, n-1)); }

In Turing:

function ackermann (m : int, n : int) : int if m = 0 then result n + 1 elsif m > 0 and n = 0 then result A (m - 1, 1) else result A (m - 1, A (m, n - 1)) end if end A

In MIPS assembly:

ackerman: #Hmm, if m == o just return 1 addi $v0, $a1, 1 #We set our return value to 1 beq $a0, $zero, end #and if a0 == 0 we end it! #oh, we're gonna make some function calls, get ready! addi $sp, -8 #Make the stack bigger for registes you'll use sw $ra, 0($sp) #Save $s- variables sw $s0, 4($sp) #Save $ra variables bne $a1, $zero, fatrec #run the following if n == 0 addi $a0, $a0, -1 #set first arg to m - 1 addi $a1, $zero, 1 #set the second arg to 1 jal ackerman j clean

fatrec: #recursing twice! add $s0, $a0, $zero addi $a1, $a1, -1 jal ackerman addi $a0, $s0, -1 add $a1, $v0, $zero jal ackerman clean: lw $s0, 4($sp) #Restore $s- variables lw $ra, 0($sp) #Restore $ra variables addi $sp, $sp, 8 #restore stack pointer end: jr $ra #Jump to where we came from

Non-Recursive Ackermann in Python

This algorithm uses a software stack much like Reverse Polish notation

def Ackermann(m, n): stack = [] stack.append(m) stack.append(n) while len(stack) > 1: n = stack.pop() m = stack.pop()

if m == 0: stack.append(n + 1) elif n == 0: stack.append(m-1) stack.append(1) else: stack.append(m-1) stack.append(m) stack.append(n-1)

return stack.pop()

Non-Recursive Ackermann in C++

int Ackermann( int n, int m) { stack stk; int rt,ff,x=NULL,y=NULL,z=NULL; bool exit = false; do{ while( n != 0 ) { if( m == 0 ){ rt = 1; stk.push( rt ); stk.push( n ); stk.push( m ); stk.push( x ); stk.push( y ); stk.push( z ); m = 1; n = n - 1;} else{ rt = 2; stk.push( rt ); stk.push( n ); stk.push( m ); stk.push( x ); stk.push( y ); stk.push( z ); m = m - 1;} } ff = m + 1; exit = false; while( stk.tos > -1 && exit == false ) { z = stk.pop(); y = stk.pop(); x = stk.pop(); m = stk.pop(); n = stk.pop(); rt = stk.pop(); if( rt == 3 )z = ff; else if( rt == 2 ){ y = ff; rt = 3; stk.push( rt ); stk.push( n ); stk.push( m ); stk.push( x ); stk.push( y ); stk.push( z ); m = y; n = n - 1; exit = true;} } }while( stk.tos > -1 ); return ff; }

And here is the algorithm of above code:

Ackermann numbers

Related to the Ackermann function but in fact different are the Ackermann numbers, a sequence where the n^th term equals:

in the Knuth's up-arrow notation, or

• 

in the Conway chained arrow notation.^[14]

For instance, the first three Ackermann numbers are

*11,

*22

*33

which equal the following:

*1 = 1

*2² = 4

*

An attempt to express the fourth Ackermann number, 44, using iterated exponentiation as above would become extremely complicated. However, it can be expressed using tetration in three nested layers as shown below. Explanation: in the middle layer, there is a tower of tetration whose full length is and the final result is the top layer of tetrated 4's whose full length equals the calculation of the middle layer. Note that by way of size comparison, the simple expression already exceeds a googolplex, so the fourth Ackermann number is quite large.

In popular culture

Randall Munroe has mentioned the Ackermann function in his popular web-comic xkcd.^[15] In the comic, Munroe makes reference to the Ackermann function with Graham's Number as the arguments. At the time, he considered this to be the largest number ever concisely defined and named it "The xkcd number".^[16]

See also

• Tetration
• Busy beaver
• Computability theory (computer science)
• Charity (programming language)

Notes and references

External links

• Eric W. Weisstein, Ackermann function at MathWorld.
• Paul E. Black, Ackermann's function at the NIST Dictionary of Algorithms and Data Structures.
• Scott Aaronson, Who can name the biggest number? (1999)
• Ackermann function's. Includes a table of some values.
• Hyper-operations: Ackermann's Function and New Arithmetical Operation
• Robert Munafo's Versions of Ackermann's Function describes several variations on the definition of A.
• Gabriel Nivasch, Inverse Ackermann without pain on the inverse Ackermann function.
• Raimund Seidel, Understanding the inverse Ackermann function (PDF presentation).