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

Undecidable and intractable are used interchangeably in my lectures

In the same hour I heard that a problem was undecidable and that another was intractable, with no line drawn between no algorithm exists and no fast algorithm is known. Those are different failures and confusing them wrecks the rest of the course. Students end up thinking undecidable means very hard.
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.