Encyclopedia Information Information Simulation Hypothesis Structure Simulation Implies Church Turing
ARTICLE 3 claims 3 theorems
Information Simulation Hypothesis Structure Simulation Implies Church Turing
A formal proof that the simulation hypothesis collapses into a tautology, and what that does and does not say about the universe.
The simulation argument's fate
The simulation hypothesis asks whether our universe might be a computer program running inside a larger, real universe. In Recognition Science, the question dissolves rather than receiving a yes or no answer. The framework's central claim is that reality is a ledger, a discrete record of recognition events, each a positive number. There is no separate physical substrate underneath this ledger; the ledger is the substrate. The hypothesis of an external computer therefore fails, because any such computer would itself be a ledger, and the distinction between the simulated and the simulator collapses.
Within this framework, the declaration simulation_implies_church_turing is a formal theorem. It states that if the simulation hypothesis holds, then physics is Church-Turing computable. The proof is a direct consequence of a more basic result: any simulated ledger is itself a ledger. The framework's library of machine-checked theorems shows that a simulated universe, defined as a sequence of positive events, is indistinguishable from a real one. The theorem is not a claim that the universe is a simulation; it is a statement about what the simulation hypothesis would entail if it were true.
The framework also proves that the question of whether a ledger is simulated is operationally empty. A perfectly simulated ledger would be a ledger, so the question reduces to whether the ledger is the ledger, which is trivially true. This is not a refutation of Bostrom's argument; it is a dissolution. The framework does not claim to know whether we live in a simulation. It claims that the distinction between real and simulated has no semantic content within its own model of reality.
What the theorem does not claim is broader than what it establishes. It does not prove that the universe is a simulation, nor does it prove that it is not. It does not claim that all physical processes are computable in the practical sense, only that the ledger's structure is. It does not address the question of whether an external simulator could exist with different rules; it only says that within the framework, such a simulator would be indistinguishable from the simulated universe. The theorem is a logical consequence of the framework's definitions, not an empirical discovery about the world.
THEOREM simulation_implies_church_turing · IndisputableMonolith/Information/SimulationHypothesisStructure.lean
/-- Church-Turing physics implies simulation-hypothesis structure. -/
theorem simulation_implies_church_turing (h : simulation_hypothesis_from_ledger) :
church_turing_physics_from_ledger := h
THEOREM simulated_rs_is_rs · IndisputableMonolith/Information/SimulationHypothesisStructure.lean
/-- **THEOREM IC-004.2**: A simulated universe that perfectly reproduces
all events of an RS universe IS an RS universe.
There is no difference between "simulated RS" and "RS". -/
theorem simulated_rs_is_rs (u : RSUniverse) (s : SimulatedUniverse)
(h : ∀ n, s.events n = u.events n) :
∃ u' : RSUniverse, ∀ n, u'.events n = s.events n :=
⟨⟨s.events, s.events_pos⟩, fun n => rfl⟩
THEOREM simulation_reduces_to_tautology · IndisputableMonolith/Information/SimulationHypothesisStructure.lean
/-- **THEOREM IC-004.8**: The question "is the universe simulated?" reduces to
a tautology in RS: any faithful simulation of RS IS RS. -/
theorem simulation_reduces_to_tautology :
∀ (u : RSUniverse) (s : SimulatedUniverse),
(∀ n, s.events n = u.events n) →
∃ u' : RSUniverse, ∀ n, u'.events n = u.events n := by
intro u s h
exact ⟨⟨u.events, u.events_pos⟩, fun n => rfl⟩
What this page does not claim
The theorem does not prove that the universe is a simulation. The theorem does not prove that the universe is not a simulation. The theorem does not claim that all physical processes are computable in practice.
Verify this page
Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:
$ lake env lean IndisputableMonolith/Information/SimulationHypothesisStructure.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)
A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.
Derived articles
This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red:
- What does it mean for physics to be Church-Turing computable in this framework?
- How does the ledger's discreteness relate to the continuity of physical laws?
- What would constitute evidence for or against the simulation hypothesis in this framework?
- Does the framework's dissolution of the simulation hypothesis apply to all possible definitions of simulation?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM simulation_implies_church_turing · IndisputableMonolith/Information/SimulationHypothesisStructure.lean
/-- Church-Turing physics implies simulation-hypothesis structure. -/ theorem simulation_implies_church_turing (h : simulation_hypothesis_from_ledger) : church_turing_physics_from_ledger := hThe declaration simulation_implies_church_turing is a formal theorem stating that if the simulation hypothesis holds, then physics is Church-Turing computable. simulation_implies_church_turing · IndisputableMonolith/Information/SimulationHypothesisStructure.leanTHEOREM simulated_rs_is_rs · IndisputableMonolith/Information/SimulationHypothesisStructure.lean
/-- **THEOREM IC-004.2**: A simulated universe that perfectly reproduces all events of an RS universe IS an RS universe. There is no difference between "simulated RS" and "RS". -/ theorem simulated_rs_is_rs (u : RSUniverse) (s : SimulatedUniverse) (h : ∀ n, s.events n = u.events n) : ∃ u' : RSUniverse, ∀ n, u'.events n = s.events n := ⟨⟨s.events, s.events_pos⟩, fun n => rfl⟩Any simulated ledger is itself a ledger. simulated_rs_is_rs · IndisputableMonolith/Information/SimulationHypothesisStructure.leanTHEOREM simulation_reduces_to_tautology · IndisputableMonolith/Information/SimulationHypothesisStructure.lean
/-- **THEOREM IC-004.8**: The question "is the universe simulated?" reduces to a tautology in RS: any faithful simulation of RS IS RS. -/ theorem simulation_reduces_to_tautology : ∀ (u : RSUniverse) (s : SimulatedUniverse), (∀ n, s.events n = u.events n) → ∃ u' : RSUniverse, ∀ n, u'.events n = u.events n := by intro u s h exact ⟨⟨u.events, u.events_pos⟩, fun n => rfl⟩The question of whether a ledger is simulated reduces to whether the ledger is the ledger, which is trivially true. simulation_reduces_to_tautology · IndisputableMonolith/Information/SimulationHypothesisStructure.lean