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

Computability and complexity get blurred when the thesis is stated

Several summaries I have read say it tells us what computers can do, which invites the reader to think it is about what can be done in practice. The claim concerns which functions are computable at all with no regard to resources. That distinction disappears in casual statements of 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.