Agenda Kernel Principle Canonical The program does not accept runtime from nowhere: substrate dependence must be treated as part of the burden, not hidden behind computation or information.
Kernel PrincipleCanonical

Substrate Non-Deferral

The program does not accept runtime from nowhere: substrate dependence must be treated as part of the burden, not hidden behind computation or information.

Not anti-computation
The principle does not reject computation, information, mathematics, or simulation as powerful ideas.
Anti-deferral
It rejects treating execution, support, and semantics as free background once they become decisive.
Explicit status
Substrate dependence must be internalized, derived, typed, factored out, bridged, or left visibly unresolved.

Why substrate deferral matters

Substrate questions often appear when a theory says that reality is computation, information, mathematics, rules, or simulation.

Those ideas can be deep. But if the account depends on something that runs the computation, carries the information, hosts the mathematics, enforces the rules, or supports the simulation, that support cannot remain unexplained while the account is treated as complete.

The principle

The program does not accept runtime from nowhere.

This is not a rejection of computational or informational approaches. It is a refusal to let their supporting substrate disappear into the background.

What counts as substrate deferral?

Substrate deferral occurs when a decisive dependency is left outside the account:

  • a computation with no account of execution
  • information with no account of bearer, distinction, or registration
  • laws with no account of why those laws have force
  • a simulation with no account of simulator, medium, or modal status
  • a mathematical universe with no account of why mathematical structure is ontically loaded

Allowed treatments

Substrate non-deferral inherits the six treatments from No Externalities. The substrate dependency may be:

  • internalized into the kernel
  • derived from deeper structure
  • typed as a dependency at a specific level
  • factored out by invariance
  • bridged explicitly to another domain
  • marked as an unresolved boundary

Any of those can be honest. Silent deferral cannot. Whatever runtime, support, or semantic load a claim depends on must be exposed and treated under one of those six modes; it may not survive as background.

The program treats Wheeler, Tegmark, Wolfram, simulation hypotheses, and other computational or informational approaches as serious neighbors, not caricatures. The Wolfram & the Ruliad comparison sets out one neighboring case in detail.

The difference is the burden assigned to substrate. Panta Rhei asks whether the support conditions can be made part of the account rather than left as an external condition.

Relation to physics and mathematics

In physics, substrate non-deferral presses on measurement, law, constants, regimes, and the status of background structure.

In mathematics, it presses on proof, syntax, semantics, formalization, and the difference between formal structure and ontic commitment.

Open frontiers

The program does not claim to have eliminated every substrate boundary. It commits to naming those boundaries and refusing to treat them as already settled.

Save or share this page for inspection

Download a portable dossier, copy a reviewer note, or send this page to someone who can inspect it.

Email to expert