go-v.orgcodex
Menu
Page tools

codex · Philosophy

Ackermann function

In computability theory, the Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a total computable function that is not primitive recursive. All primitive recursive functions are total and computable, but the Ackermann function illustrates that not all total computable functions are primitive recursive. It is essentially constructed by diagonalizing a sequence of primitive recursive functions f1,f2,… selected from the Grzegorczyk hierarchy. This makes the Ackermann function the first limit point fω of the fast-growing hierarchy.

After Ackermann's publication of his function (which had three non-negative integer arguments), many authors modified it to suit various purposes, so that today "the Ackermann function" may refer to any of numerous variants of the original function. One common version is the two-argument Ackermann–Péter function developed by Rózsa Péter and Raphael Robinson. This function is defined from the recurrence relation A⁡(m+1,n+1)=A⁡(m,A⁡(m+1,n)) with appropriate base cases. Its value grows very rapidly; for example, A⁡(4,2) results in 265536−3, an integer with 19,729 decimal digits.

Wikipedia contributors, "Ackermann function", Wikipedia, revision 1381937487, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex