PhilArchive
open access
Halting problem undecidability and infinitely nested simulation (V2)
The halting theorem counter-examples present infinitely nested simulation (non-halting) behavior to every simulating halt decider. Whenever the pure simulation of the input to simulating halt decider H(x,y) never stops running unless H aborts its simulation H correctly aborts this simulation and returns 0 for not halting.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Halting problem undecidability and infinitely nested simulation (V3)#757819
- Halting problem undecidability and infinitely nested simulation#757830
- Rebutting the Sipser Halting Problem Proof V2#733369
- Rebutting the Sipser Halting Problem Proof --- D(D) correctly reports its own halt status#102806
- Simulation Typology and Termination Risks#774090
Record · ID 757821
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive