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

Which model of computation we fixed is never stated

The result is proved for some machine and then quoted for programs in general, with the bridge left out. I do not need the full equivalence apparatus, just a line saying the argument goes through for any model with a universal interpreter and the ability to encode programs. Without it, I could not tell whether the theorem applied to the language I write in.
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.