Quizzes for review
The halting problem is a classic example of an undecidable decision problem in computability theory.
See correct answer
The halting problem is a classic example of an undecidable decision problem in computability theory.
音声機能が動作しない場合はこちらをご確認ください
Related words
undecidable
Adjective
not-comparable
Japanese Meaning
数学や計算理論において、有限な時間内でアルゴリズムによって解決（決定）できない性質を持つこと。 / 有限のステップで正確な判断や決定が不可能な問題や集合に対して用いられる。
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
