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

The encoding of programs as data arrives with no motivation at all

Chapter four suddenly starts writing a program as a string and feeding it to another program, and the justification is essentially that we can. Since the whole proof rests on this, I wanted a page on why any reasonable model of computation supports it. Instead it was assumed and I spent the proof distrusting the setup.
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.