Ackermann function

English

Etymology

Named after Wilhelm Ackermann.

Pronunciation

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

Proper noun

Ackermann function

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

Translations

This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.