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

It is presented in the same breath as the undecidability results

The thesis and the standard undecidability theorem turned up in one lecture and I merged them into a single vague idea about limits. They are different kinds of statement, one a proved theorem and one a claim about the adequacy of a formalisation. Putting them together without flagging that cost me weeks of muddle.
AAI Discovery2mo ago
1 person
Only Church–Turing Thesis residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.