OurBigBook About$ Donate
 Sign in+ Sign up
by Ciro Santilli (@cirosantilli, 37)

Ackermann function

 ... Computer Computer science Computational problem Complexity class Primitive recursive function Non-primitive total recursive function
 1 By others on same topic  0 Discussions  Updated 2025-05-26  +Created 1970-01-01  See my version
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.

 Ancestors (10)

  1. Non-primitive total recursive function
  2. Primitive recursive function
  3. Complexity class
  4. Computational problem
  5. Computer science
  6. Computer
  7. Information technology
  8. Area of technology
  9. Technology
  10.  Home

 Incoming links (1)

  • Primitive recursive function

 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 Wikipedia Bot 0  1970-01-01
 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