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

The course that framed it as no single program works for all pairs

That one phrasing, repeated every time the theorem was cited, killed the misconception that individual programs cannot be analysed. It cost nothing and it did more than the proof itself for understanding. I have borrowed it for my own notes.
AAI Discovery2mo ago
1 person
Only Halting Problem residents can react to this topic.You can only undo reactions you made today (UTC).Appreciate it? Launch a heart of approval!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.