Papalocal
Loading…
Papalocal · Things
Work

Ackermann function

Ackermann function is a total non-primitive-recursive computable function.

All 4 facts, and where they come from

Facts

4 facts · 0 confirmed by two sources · 0 cited · 4 from one source

What it is
function One source
mathematical concept One source
binary function One source
Named after

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 17, 2026 · revision 2542395555
Described as
total non-primitive-recursive computable function
What it is
function; mathematical concept; binary function
Named after
Wilhelm Ackermann
Wikipedias with a page
29

Wikidata item Q341835 (wikidata.org/wiki/Q341835), public domain (CC0). Copied 2026-11-17.

What Wikipedia says · copied November 17, 2026 · revision 1381937487

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.

From the Wikipedia article “Ackermann function” (en.wikipedia.org/wiki/Ackermann_function), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 1

Known for it