Ackermann function
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Named after Wilhelm Ackermann.
Proper noun[edit]
- (computing theory) One of the simplest and earliest examples of a total computable function that is not primitive recursive.
Translations[edit]
a total computable function that is not primitive recursive
|