最終更新日：2024/08/02

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

正解を見る

Ackermann function

問題を編集する

元となった辞書の項目

Ackermann function

name

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

The Ackermann function is a recursive function named after Wilhelm Ackermann.

意味（1）

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