Lesson plan

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 f_1, f_2, \dots selected from the Grzegorczyk hierarchy. This makes the Ackermann function the first limit point f_\omega 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 \operatorname{A}(m+1, n+1) = \operatorname{A}(m, \operatorname{A}(m+1, n)) with appropriate base cases. Its value grows very rapidly; for example, \operatorname{A}(4, 2) results in 2^{65536} - 3 , an integer with 19,729 decimal digits.

Back to article

Article summary

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 f_1, f_2, \dots selected from the Grzegorczyk hierarchy. This makes the Ackermann function the first limit point f_\omega 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 \operatorname{A}(m+1, n+1) = \operatorname{A}(m, \operatorname{A}(m+1, n)) with appropriate base cases. Its value grows very rapidly; for example, \operatorname{A}(4, 2) results in 2^{65536} - 3 , an integer with 19,729 decimal digits.

Key claims

  1. publication date: 1928 — source: Wikipedia, revision 1371837275, retrieved 2026-10-20 · confidence 0.95
  2. publication date: 1970 — source: Wikipedia, revision 1371837275, retrieved 2026-10-20 · confidence 0.95
  3. publication date: 2012-10-20 — source: Wikipedia, revision 1371837275, retrieved 2026-10-20 · confidence 0.95

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. The record states that the publication date is "1928". What evidence would count against this claim?
  3. The record states that the publication date is "1970". What evidence would count against this claim?
  4. The record states that the publication date is "2012-10-20". What evidence would count against this claim?
  5. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  6. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

  1. Wikipedia, “Ackermann function”, revision 1371837275, retrieved 2026-10-20 https://en.wikipedia.org/w/index.php?oldid=1371837275

Key claims and bibliography are generated from the same tracked claims and sources as the article page.