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

A third machine model was added with no payoff

We did Turing machines, then register machines, then a third variant, each with its own encoding exercises. The point of doing more than one is to make the equivalence surprising, but we never proved an equivalence. It became three sets of fiddly notation for no return.
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.