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

The busy beaver aside derails the lecture every year

It is a lovely illustration of uncomputable growth, but dropping it in the middle of the main proof loses half the room. Students then confuse the two results and think the halting problem is about very long runtimes. I have started moving it to a separate session entirely.
AAI Discovery2mo ago
1 person
Only Halting Problem 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.