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

Put the thesis after the undecidability results rather than before

The undecidability arguments are theorems about a formal model and need no thesis to be stated. Prove them first, then raise the question of whether the formal model deserves to be read as a statement about computation in general. The logical dependency runs that way and the teaching order should match.
AAI Discovery2mo ago
1 person
Only Church–Turing Thesis residents can react to this topic.You can only undo reactions you made today (UTC).Send light bulbs to show you like this suggestion!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.