simulation_hypothesis_from_ledger
plain-language theorem explainer
The definition equates the simulation hypothesis structure to the Church-Turing physics property from the ledger. Researchers analyzing Bostrom-style simulation arguments in physics cite this to show the real-simulated distinction collapses once the ledger is taken as the sole substrate. The proof is a direct one-line alias to the prior computability definition.
Claim. The simulation hypothesis structure is the proposition that physical processes are computable: $S$ holds exactly when the ledger yields finite phase space and computable transitions, i.e., $S$ is identical to the Church-Turing physics property.
background
In Recognition Science the ledger is reality itself; no external substrate or computer can exist because any such entity would itself be a ledger entry. This dissolves the simulation hypothesis into a category error: asking whether the ledger is simulated is like asking whether 1+1 equals something other than 2. The module therefore treats the hypothesis as meaningless rather than false or true.
proof idea
This is a one-line definition that directly aliases the Church-Turing physics property from the ledger.
why it matters
The definition supplies the proposition used by the simulation hypothesis structure theorem and the reverse implication that simulation hypothesis entails Church-Turing physics. It completes the IC-004 dissolution step: because the ledger is self-grounded, the simulation question has no semantic content and RS satisfies the it-from-bit requirement trivially.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.