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

Put Rice's theorem immediately after as the general case

Once students have one undecidable problem and one reduction, the statement that every non-trivial semantic property is undecidable is the natural next slide and it reframes everything they just did. Leaving it to an optional section makes the halting result look isolated. It is the payoff for the reduction machinery.
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.