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

We meet the undecidable case before any decidable problem is established

The first decision problem I ever saw was the one with no algorithm, so I had no baseline for what deciding even means. Showing something decidable, then something semi-decidable, then the negative result would have given the word content. As taught, the whole topic is defined by its exception.
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.