has_ct_structure
plain-language theorem explainer
Recognition Science derives the Church-Turing physics property directly from its ledger structure, confirming that physical processes remain computable. Researchers examining the simulation hypothesis cite this link to show that any external substrate collapses into the same finite-phase ledger. The proof is a one-line term reduction to the prior church_turing_physics_structure theorem.
Claim. The Church-Turing physics property holds: physical processes are computable because the phase space is finite (eight phases), transitions are computable functions on finite types, and the tick rate is bounded by $1/τ_0$.
background
The module dissolves the simulation hypothesis by identifying the ledger as the unique physical substrate with no external distinction. The Church-Turing physics property is formalized as the proposition computation_limits_from_ledger, which encodes that all physical processes are computable. This rests on the Primitive Distinction result deriving four structural conditions plus three definitional facts from seven independent axioms, together with the explicit statement that dynamics on the eight-phase space remain computable even though $φ$ is irrational.
proof idea
The proof is a term-mode one-liner that directly applies the church_turing_physics_structure theorem, which itself reduces to has_computation_limits_structure.
why it matters
The result supplies the missing step for simulation_hypothesis_structure (IC-004.7), which concludes that the simulation hypothesis structure holds. It completes the IC-004 chain by tying Church-Turing physics to the ledger, reinforcing the module claim that the simulation/reality distinction carries no semantic content and that RS satisfies the it-from-bit requirement trivially. It touches the self-grounding of the ledger and the eight-tick octave structure.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.