Ackermann function

Definition from Wiktionary, the free dictionary
Jump to: navigation, search

English[edit]

Etymology[edit]

Named after Wilhelm Ackermann.

Proper noun[edit]

Ackermann function

  1. (computing theory) One of the simplest and earliest examples of a total computable function that is not primitive recursive.

Translations[edit]