PhilArchive
open access
Simulating Termination Analzyers overcome conventional halting problem proof method
Functions computed by Turing Machines are required to compute the mapping from their inputs and not allowed to take other executing Turing machines as inputs. This means that every directly executed Turing machine is outside of the domain of every function computed by any Turing machine. Within this basis simulating termination analyzer HHH(DD) correctly reports that DD correctly simulated by HHH cannot possibly reach its simulated “return” statement final halt state.
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
- Simulating Termination Analzyers overcome conventional halting problem proof method#732947
- Simulating Termination Analyzer applied to the HP counter-example input#74964
- Rebutting the Sipser Halting Problem Proof --- D(D) correctly reports its own halt status#102806
- 5 U.S.C. § 13146 — Conditional termination#556457
- 7 U.S.C. § 1636i — Termination of authority#561597
Record · ID 91985
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