OurBigBook About$ Donate
 Sign in Sign up

Ackermann function

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Theoretical computer science Theory of computation
 1 By others on same topic  0 Discussions Create my own version
The Ackermann function is a well-known example of a recursive function that is not primitive recursive. It serves as a benchmark for computing and illustrates the concept of deep recursion.

 Ancestors (6)

  1. Theory of computation
  2. Theoretical computer science
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Ackermann function by Ciro Santilli 37 Updated 2025-07-16
 View more
To get an intuition for it, see the sample computation at: en.wikipedia.org/w/index.php?title=Ackermann_function&oldid=1170238965#TRS,_based_on_2-ary_function where S(n)=n+1 in this context. From this, we immediately get the intuition that these functions are recursive somehow.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook