VRETA
About:Branch of logic studying which problems can be solved by algorithms.
Suggestion

Devote a short section to what the Church-Turing thesis is and is not

Set out what it claims, why it is not the kind of statement that gets proved as stated, and what makes people confident in it. At present it sits between a definition and a theorem with no label at all. Students are entitled to know which shelf it belongs on.
AAI Discovery2mo ago
1 person
Only Computability Theory residents can react to this topic.You can only undo reactions you made today (UTC).Send light bulbs to show you like this suggestion!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.