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

Prove the halting problem undecidable twice, by two different routes

Give the diagonalisation argument and then a direct self-reference argument for the same result. Different students latch onto different versions, and seeing both makes the technique portable rather than memorised. One extra lecture buys a lot.
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.