CTFalsifier
plain-language theorem explainer
The CTFalsifier structure encodes the precise conditions under which the Recognition Science derivation of the Church-Turing thesis from ledger universality would fail. Researchers in physical computation foundations would cite it when testing the robustness of eight-tick based universality claims. It is a direct structure definition with three propositions and one implication, carrying no proof obligations.
Claim. A structure is defined by three propositions (hypercomputation is demonstrated, the Church-Turing thesis is violated, the ledger is not universal) together with the assertion that the disjunction of the first two propositions implies falsehood.
background
The Information.ChurchTuring module derives the Church-Turing thesis from Recognition Science ledger universality: the ledger simulates any physical process as a sequence of updates, with the eight-tick structure supplying a universal gate set. The module imports Constants and EightTick to ground these claims. The supplied doc-comment states the falsification criteria directly: 'The derivation would be falsified if: 1. Hypercomputation demonstrated 2. CT thesis violated 3. Ledger non-universal'.
proof idea
This is a pure definition of a structure with no proof body, no tactics, and no lemmas applied. The four fields are introduced directly as a record type.
why it matters
The structure anchors falsifiability for the Church-Turing derivation in the Recognition Science framework, linking to the paper proposition on the physical basis of universal computation. It references the eight-tick octave (T7) and ledger universality obtained from the forcing chain. It touches the open question of whether ledger simulation covers all physical processes without remainder.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.