Answers are grounded in this paper and cite their sources.
Consider an observer embedded in a computation, a pattern that can neither step outside the machine nor outrun it. Behind the machine lies a complete record of what every part does, an answer sheet. Without a shortcut, the insider cannot read that sheet faster than the machine writes it. What is the best description such an insider can hold? Computational Wave Field Theory proposes a complex wave over the machine’s locations, with a Born rule for computational events and an action scale set by each computational substrate’s hardware. We present the framework as one argument, with every claim marked as computed or proved, a bridge, a conjecture or speculation. Tested on cellular automata, the wave forecasts no better than ordinary probabilities. For models fitted to a limited history, quantum memory with real amplitudes can store forecasts more compactly. If the questions asked are independent of a definite record, ignorance of that record cannot produce contextual statistics. In a minimal model, a smooth, reversible and faithful self-negation forces the imaginary unit, and gauging the resulting phase over the machine gives a lattice analog of light. On weakly coupled machines, horizons form where computation freezes. Four thermodynamic tests of Einstein’s equation fail on three leaky families. On a holographic error-correcting code, a first-law analog holds in almost all tested cases and, through a holographic bridge, reads as a linear analog of that equation. One physical wager remains, that nature derives its imaginary unit from self-reference instead of postulating it.
No takes yet. Share an insight, caveat, or question.
O. Cem Yilmaz (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: