Ackermann function
Sign in to savetotal non-primitive-recursive computable function
~37 min read
Article
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
Connections
recursion
Entity
floor and ceiling functions
Entity
Raphael M. Robinson
Entity
number
Entity
International Standard Book Number
Entity
David Hilbert
Entity
algorithm
Entity
Python
Entity
natural number
Entity
Carl Sagan
Entity
addition
Entity
multiplication
Entity
division
Entity
logarithm
Entity
1000000
Entity
subtraction
Entity
Q43016
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
compiler
Entity