Last Updated
：2025/11/20
Quizzes for review
(computing theory) Capable of computing any recursive function.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
functionally complete
The untyped lambda calculus is functionally complete because it can compute any recursive function.
See correct answer
The untyped lambda calculus is functionally complete because it can compute any recursive function.
音声機能が動作しない場合はこちらをご確認ください
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
