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

Rice's theorem is dropped in a remark and never unpacked

The generalisation says that any non-trivial property of the function a program computes is undecidable, which is a much stronger and more useful statement than the halting case alone. It gets one sentence in small type. Stating a stronger theorem in a footnote and then examining only the special case is backwards.
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.