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

Popular accounts say it was proved

I have lost count of the articles that describe it as a landmark theorem establishing the limits of computation. It is not a theorem and saying so is not a quibble, because the interesting question is exactly what kind of support it has. The popular version removes the one thing worth discussing.
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.