The GTE–Wolfram Bridge
Both GTE and the Wolfram Physics Project start from discrete computational rules and arrive at universal computation. Where they agree, and where GTE adds what Wolfram lacks: a selection principle.
The Wolfram Physics Programme
The Wolfram Physics Project (Stephen Wolfram and Jonathan Gorard, 2020) is the most recent systematic attempt to derive physics from a discrete computational rule. It has three key components:
The programme is maximally inclusive: it defines the Ruliad as the union of all possible computations. The physical universe is somewhere in the Ruliad — but which specific rule describes it?
The Wolfram Physics programme has no selection principle. The Ruliad contains every possible computational rule. There is no mechanism for identifying which rule is the one that generates our universe. This is the question that GTE answers.
What GTE Adds: The Selection Principle
GTE provides what Wolfram Physics lacks: a selection principle that identifies the unique computational rule from first principles, and machine-certifies it.
Minimum Description Length (MDL) selects the rule. Among all
rules consistent with the derivability constraints (chirality, color,
three-generation spectrum, and Lorentz invariance), the shortest description
is p(L,C,R) = C+R−CR−LCR mod 7 — 19 bits.
This is the unique MDL-minimal rule.
MDL selection is not a metaphysical claim about "what the universe prefers." It is a mathematical theorem: given the derivability constraints, only one rule survives the five-step elimination funnel explained in L08.
The Triangle: Two Paths to Rule 110
One of the most striking connections between GTE and Wolfram Physics is that both arrive at Rule 110 — the specific 1D cellular automaton rule that Wolfram has shown to be computationally universal — but via completely different paths.
Path A: Direct-Interpolation Lift
The GTE polynomial p over GF(7) operates on 7-state cells. When restricted to the binary subfield {0, 1} ⊂ GF(7), the polynomial evaluates to the Rule 110 look-up table exactly. This is not a coincidence — the MDL selection that picks p is the same principle that forces the binary restriction to be the simplest universally-computing 1D rule.
Path B: Wolfram's Computational Universality Argument
Wolfram and collaborators have shown that Rule 110 is computationally universal — it can simulate any Turing machine. This means Rule 110 is not just complex; it is capable of representing any computable physics. A universe that can be described by a computationally universal rule is one where no further selection is needed: the rule can produce any pattern in the Ruliad.
Convergence: MDL selection (Path A) and computational universality (Path B) both single out Rule 110 as the fundamental rule. This convergence is not trivial — it provides independent confirmation that Rule 110 is the correct underlying structure.
Three Key Distinctions
For readers familiar with Wolfram Physics, here are the three most important points of difference:
The Chirality Census: {Rule 110, Rule 124}
One specific connection between GTE and Wolfram Physics is the chirality census. The GTE polynomial's CMCA uses both Rule 110 (right-chiral) and Rule 124 (left-chiral) as its two outer layers. Together they form a chiral pair.
Wolfram Physics uses a single rule operating on an undirected hypergraph. GTE's insight is that chirality — the asymmetry between left-handed and right-handed particles observed in the weak force — requires a fundamentally directed computational rule. The CMCA pair {Rule 110, Rule 124} is the minimal directed-rule structure that is:
- Computationally universal (via Rule 110)
- Chirally asymmetric (Rule 110 ≠ Rule 124)
- MDL-minimal (two rules that are mirror images of each other)
This explains the observed parity violation in the weak force: it is a direct consequence of the chiral asymmetry of the underlying CA pair.
Path 3 Complete
You have now covered all six lessons of Path 3 — Particles: