PhilArchive
open access
Halting problem undecidability and infinitely nested simulation (V4)
A Simulating Halt Decider (SHD) computes the mapping from its input to its own accept or reject state based on whether or not the input simulated by a UTM would reach its final state in a finite number of simulated steps. A halt decider (because it is a decider) must report on the behavior specified by its finite string input. This is its actual behavior when it is simulated by the UTM contained within its simulating halt decider while this SHD remains in UTM mode.
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
- Agent Based Simulation Output Analysis#682852
- Concept Project Information Document (PID) - Digital Gabon - P175987#8414
- The Aegis Solis Archive — Master Hash Manifest (v13.0 FINAL)#124961
- Computing the uncomputable; or, The discrete charm of second-order simulacra#93106
- Les décisions individuelles et collectives en simulation de gestion de crise : heuristiques, raisonnements et interactions au sein d'un collectif#1053357
Record · ID 757820
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