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

The convergence of independent formalisations is the persuasive part and it is a footnote

Several quite different attempts to formalise effective procedure landed on the same class of functions, and that coincidence is what makes the thesis compelling. In my textbook it is a remark at the end of a section. The strongest argument for the material is presented as an aside.
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.