Last Updated
：2025/11/28
Ackermann function
Proper noun
Japanese Meaning
計算理論において、原始再帰関数では表現できない全体計算可能な関数の中でも、最も単純かつ初期に示された例の一つである。
Quizzes for review
(computing theory) One of the simplest and earliest examples of a total computable function that is not primitive recursive.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
Ackermann function
When studying computability, I was fascinated by how the Ackermann function grows faster than any primitive recursive function despite its simple definition.
See correct answer
When studying computability, I was fascinated by how the Ackermann function grows faster than any primitive recursive function despite its simple definition.
音声機能が動作しない場合はこちらをご確認ください
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
