simulation_implies_church_turing
plain-language theorem explainer
The simulation hypothesis derived from the ledger directly implies the Church-Turing physics structure. Researchers in foundations of physics and computability would cite this to show how simulation assumptions reduce to ledger-based computability constraints. The proof is a direct term application of the given hypothesis.
Claim. If the simulation hypothesis holds from the ledger, then Church-Turing physics holds from the ledger.
background
Recognition Science treats the ledger as the sole physical substrate, eliminating any distinction between a base reality and its simulation. The simulation hypothesis from the ledger asserts that any faithful reproduction of the ledger must itself constitute an RS universe. Church-Turing physics from the ledger encodes the computability limits inherent in the ledger's structure. This module dissolves the simulation question by showing that the ledger requires no external substrate. Upstream results on the Church-Turing physics from the ledger provide the target structure that follows immediately from the hypothesis.
proof idea
The proof applies the hypothesis directly in term mode to obtain the Church-Turing physics structure. It is a one-line wrapper that invokes the simulation hypothesis from the ledger without further reduction.
why it matters
This theorem supports the dissolution of the simulation hypothesis in the Recognition framework by linking it to Church-Turing physics. It contributes to the module's argument that the simulation/reality distinction lacks semantic content in RS. The result aligns with the ledger being self-grounded and satisfies the 'it from bit' principle trivially, as noted in the module documentation.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.