Ackermann function
English
Etymology
Named after Wilhelm Ackermann.
Proper noun
- (computing theory) One of the simplest and earliest examples of a total computable function that is not primitive recursive.
Translations
a total computable function that is not primitive recursive
|
|
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.