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

Non-primitive total recursive function

 ... Information technology Computer Computer science Computational problem Complexity class Primitive recursive function
 0 By others on same topic  0 Discussions  Updated 2025-05-26  +Created 1970-01-01  See my version
  • Table of contents
    • Ackermann function Non-primitive total recursive function

Ackermann function

 1  0 
Non-primitive total recursive function
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 (9)

  1. Primitive recursive function
  2. Complexity class
  3. Computational problem
  4. Computer science
  5. Computer
  6. Information technology
  7. Area of technology
  8. Technology
  9.  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 (0)

There are currently no matching articles.
  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