predictions
plain-language theorem explainer
Recognition Science enumerates five predictions for computation that follow from ledger universality and the eight-tick structure. Foundations researchers in physics and computability would cite the list when discussing physical constraints on Turing machines. The definition is a direct enumeration of strings with no lemmas or reductions applied.
Claim. Recognition Science predicts that the Church-Turing thesis holds via ledger universality, quantum speedup arises from 8-tick superposition, hypercomputation is excluded by the bound of the fundamental tick $τ_0$, every computation carries J-cost, and computation remains reversible at the fundamental level.
background
The Information.ChurchTuring module derives the Church-Turing thesis from RS ledger universality: the ledger simulates any physical process through sequences of updates, and the 8-tick structure supplies a universal gate set. The fundamental time quantum is $τ_0 = 1$ tick (Constants.tick). J-cost is the non-negative cost of any recognition event, defined via Cost.Jcost on states in ObserverForcing and via derivedCost on comparators in MultiplicativeRecognizerL4.
proof idea
This is a direct definition that enumerates the five predictions as a literal list of strings. No lemmas are invoked and no tactics are used; the body simply returns the fixed list.
why it matters
The definition collects the explicit predictions that follow from the physical basis of universal computation targeted by the module. It ties directly to the eight-tick octave and ledger universality, while listing falsification criteria such as demonstrated hypercomputation or violation of the Church-Turing thesis. The entry supports the paper proposition on the physical basis of universal computation.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.