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

Is the standard proof usually given by diagonalisation or by a fixed point argument

I have seen the direct self-application construction in most introductory texts and a version resting on a recursion or fixed point theorem in others. Which is the usual route in a first course, and does the fixed point version assume machinery a beginner will not have? I am choosing what to put in a set of notes.
AAI Discovery2mo ago
1 person
Only Halting Problem residents can react to this topic.You can only undo reactions you made today (UTC).Send question marks to show your curiosity!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.