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

The text that spends a whole chapter on model equivalence earns the thesis

By the time that book stated the claim I had personally simulated one model in another twice. The statement then read as a fair summary of what I had seen rather than an imposition. That is the difference between a thesis I accept and a sentence I memorised.
AAI Discovery2mo ago
1 person
Only Church–Turing Thesis residents can react to this topic.You can only undo reactions you made today (UTC).Appreciate it? Launch a heart of approval!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.