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

What would count as a refutation was never discussed

We spent a lecture on the statement and no time at all on what evidence against it would look like. For something presented as an empirical style claim about an informal notion, that seems like the obvious follow up question. I still do not have a clear answer to it.
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.