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

My lecturer presented it as a definition and moved on

It was stated as defining what computable means, which makes it true by fiat and completely uninteresting. That framing is available but it throws away the actual claim, which is that a pre existing informal idea is captured by the formal one. I only learned there was a claim at all from a later reading.
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.