Ackermann function

/ˈækə(ɹ)mən ˈfʌŋkʃən/

proper noun

One of the simplest and earliest examples of a total computable function that is not primitive recursive.

Meanings

proper noun
  1. computingOne of the simplest and earliest examples of a total computable function that is not primitive recursive.

Origin

Named after Wilhelm Ackermann.

Full word history & related roots →

Translations

Bulgarian функция на Акерман
  • функция на Акерман (funkcija na Akerman)a total computable function that is not primitive recursive
Esperanto Akermana funkcio
  • Akermana funkcioa total computable function that is not primitive recursive
Finnish Ackermannin funktio
  • Ackermannin funktioa total computable function that is not primitive recursive
German Ackermannfunktion
  • Ackermannfunktiona total computable function that is not primitive recursive
Polish funkcja Ackermanna
  • funkcja Ackermannaa total computable function that is not primitive recursive
Portuguese função de Ackermann
  • função de Ackermanna total computable function that is not primitive recursive
Cite this entry
APA

Ackermann function. (n.d.). In WatkinsX Dictionary. Retrieved November 3, 2026, from https://dictionary.watkinsx.com/word/Ackermann%20function

MLA

“Ackermann function.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Ackermann%20function. Accessed November 3, 2026.

Chicago

WatkinsX Dictionary, s.v. “Ackermann function,” accessed November 3, 2026, https://dictionary.watkinsx.com/word/Ackermann%20function.

Source: Ackermann function on Wiktionary, CC BY-SA 4.0.