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

The exam asks me to state it and never to discuss its status

Full marks are available for reproducing the sentence. The interesting questions, what kind of claim it is and what supports it, appear nowhere on any past paper I have seen. So everyone learns it as a sentence.
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.