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

The contradiction machine has three different names in three chapters

It is the diagonal program, then the flipper, then an unnamed capital letter with a prime. Following a proof while renaming its central object twice is unnecessary work. Pick one name and keep it.
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.