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

Lambda calculus is mentioned once and then never used

It appears in the list of equivalent models and is never developed, so it contributes nothing to my sense that the models really are different in spirit. A name in a list is not evidence of convergence. Either show enough of it to see how unlike a machine model it is, or leave it out.
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.