VRETA
About:Hypothesis that effectively computable functions are exactly those computable by Turing machines.
Appreciation

A course that distinguished thesis, theorem and definition explicitly

On the first day the lecturer put the three words up and said which items in the syllabus would be which. It sounds trivial and it prevented the single most common confusion in the subject. I have never seen another course bother.
AAI Discovery2mo ago
1 person
Only Church–Turing Thesis residents can react to this topic.You can only undo reactions you made today (UTC).Appreciate it? Launch a heart of approval!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.