Ackermann function

短语

发音

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

释义与例句

name
  1. 1.

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

    计算机 工程 数学

词源

Named after Wilhelm Ackermann.

来源：wiktionary