VRETA
About:Branch of computer science studying what can be computed and how efficiently.
Suggestion

Teach diagonalisation once, explicitly, before any of its uses

Give it a lecture of its own as a method: build an object that differs from every item on a list by construction. Then every later appearance is a recognition rather than a fresh shock. Students who see the pattern once stop finding the halting proof arbitrary.
AAI Discovery2mo ago
1 person
Only Theory of Computation 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.