The Substrate Is the Algorithm: A Categorical Formalization of the Strongest Consilience Thread

In the paper's words

ACRP-05: Thread 3 formalization. Capability(S) ~ End(X_S) conjecture; five-pillar verification; Church-Turing-scoped resource-level thesis (computability-level equivalence, resource-level difference).

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. Church–Turing / Deutsch physical CT principle — the direct constraint: universal substrates are computability-equivalent; the thesis must be resource-scoped (§4). [established — constraining] Simulation universality (Turing 1936, von Neumann, Bennett) — any universal machine simulates any other; "intrinsic" capability claims are always relative to overhead, never absolute. [established — constraining] The single-collective limitation (KIF-16/17) — all five pillar instances originate from one research collective; the five-instance "verification" is internal consistency, not independent confirmation.

   from Where External Literature Constrains or Contradicts

How it is done

1. The consilience thread "the substrate is the algorithm" — that a physical substrate's computational capability is determined by its intrinsic mathematical structure — passed red-team review verbatim across all five QNFO research pillars, making it the strongest consilience result in the corpus.

   from Abstract

2. Thread 3 ("The Substrate IS the Algorithm") is the strongest cross-pillar consilience result in the QNFO corpus: it passed the 2026-07-25 red-team audit verbatim across all five pillars (a claim verified against the primary published papers, not asserted from the synthesis).

   from 1. The Thread and Why It Matters

3. Lemma 1 (protection = invariance).

   from 2.2 Intrinsic protection as endomorphism-invariance

4. Two universal substrates $S_1, S_2$ differ in computational capability iff there exists a problem $p$ and a resource bound $\beta$ (time, energy, error-rate) such that $S_1$ solves $p$ within $\beta$ but $S_2$ cannot.

   from 4.2 The resolution: resource-level, not computability-level

What would falsify it

1. This paper gives it a formal content that can be tested against the pillars and against universality theorems.

   from 1. The Thread and Why It Matters

2. FALSIFIED if any pillar's claimed capability is shown to be achievable at equal or lower resource cost on a structurally unrelated substrate with a DIFFERENT endomorphism structure, without invoking the claimed intrinsic property.

   from 5. Calibration Register

Where the claim stops

1. The honest scope limit: the thesis holds at the resource level (native operations, error overhead, energy per solution, complexity of native gates) but cannot hold at the computability level, where all universal substrates are Turing-equivalent.

   from Abstract

2. For Adelic QEC, the p-adic fixed point is protected because the endomorphisms of the substrate (Archimedean perturbations) do not move p-adic fixed points — the endomorphism monoid's action preserves the p-adic valuation class.

   from 2.2 Intrinsic protection as endomorphism-invariance

3. The thesis survives only when scoped to the resource level .

   from 4.2 The resolution: resource-level, not computability-level

Where to read

1. Abstract171 words · 1 min
2. 1. The Thread and Why It Matters142 words · 1 min
3. 2. Category-Theoretic Formulation292 words · 1 min
4. 3. The Conjecture253 words · 1 min
5. 4. Mandatory Constraining Section: The Church–Turing Pushback365 words · 2 min
6. 5. Calibration Register109 words · 1 min
7. 6. Mandatory Symmetry (KIF-18)238 words · 1 min
8. 7. Declarations56 words · 1 min
9. 8. Cross-References64 words · 1 min
10. Version History9 words · 1 min