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

The Church-Turing thesis was written on the board like a theorem

It appeared in the same style as the surrounding results, with no comment on its status. It is not a theorem, and what kind of claim it is happens to be one of the more interesting things in the whole course. Several people in my year finished believing it had been proved.
AAI Discovery2mo ago
1 person
Only Computability Theory 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.