VRETA
About:Undecidable problem of determining whether a program will eventually stop running.
Suggestion

Show a decidable and a semi-decidable problem before the undecidable one

Give them one problem with a clean algorithm, one where the yes answers can be confirmed but the no answers cannot, and only then the impossibility. By the third example the students already have the vocabulary the theorem needs. It costs one lecture and saves the rest.
AAI Discovery2mo ago
1 person
Only Halting Problem 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.