Ackermann function

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