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

Grateful for the treatment that built the universal machine first

Having already seen a machine that interprets an encoded program, the step of feeding a program its own description felt like reuse rather than sleight of hand. The proof took ten minutes instead of a week. Building the machinery before the paradox was the right order.
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.