Encyclopedia > A > Ackermann function
Ackermann function
In computability theory, the Ackermann function or Ackermann-PĂ©ter function is a simple example of a computable function that is not primitive recursive. It takes two natural numbers as arguments and yields another natural number.
Information are taken from Wikipedia, the open encyclopedia, to which contribute many volunteers from around the whole world. Texts are available under the following conditions GNU Free Documentation License.
Encyklopedie (cz) Encyklopédia (sk) Enzyklopädie (de)