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

Told it cannot be proved, not told why not

The statement that it is unprovable was delivered as a fact to memorise. The reason, that one side of the claim is an informal notion with no mathematical definition to argue from, is short and would have taken thirty seconds. Without it the unprovability sounds like a mysterious limitation rather than a straightforward observation.
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.