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

Nobody says the theorem is about a single decider working for every input

Half my study group came out believing that no program can ever be shown to halt, which is obviously false since plenty of programs visibly terminate. The statement is that no one algorithm decides it for all program and input pairs. That quantifier is doing all the work and it is never written on the board.
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.