English

edit
 Ackermann function on Wikipedia

Etymology

edit

Named after Wilhelm Ackermann.

Pronunciation

edit
  • IPA(key): /ˈækə(ɹ)mən ˈfʌŋkʃən/
  • Audio (US):(file)

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