Ackermann function

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English

[edit]
 Ackermann function on Wikipedia

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]
Retrieved from "https://en.wiktionary.org/w/index.php?title=Ackermann_function&oldid=70958915"