Research Program: Algorithmic Emergence in a Superdeterministic Universe

The universe may be fully deterministic underneath, and quantum weirdness might just be what determinism looks like when you can't compress it.

The central bet here is that emergence — the appearance of genuinely new phenomena at higher scales — isn't ontologically real. Nothing new is being added to the universe. Instead, emergence is what happens when an agent (a measurer, a model-builder) hits the hard limits of algorithmic compression. Kolmogorov complexity (roughly: the length of the shortest program that reproduces a dataset) is provably uncomputable, thanks to Gödel and Turing. So even a perfect observer embedded in a fully deterministic universe cannot, in principle, predict everything. That epistemic ceiling is the paper's engine.

Ruffini stacks this into three layers. At the bottom (the "p-scale") sits a superdeterministic substrate — think cellular automaton, everything fixed by initial conditions, no randomness anywhere. But computational irreducibility is maximal here: no agent can live at this scale and extract useful predictions. One level up (the "q-scale") is where quantum mechanics lives. The claim is striking: quantum mechanics isn't fundamental physics handed down from nature — it's the shortest program an agent can write to describe coarse-grained p-scale data. Wavefunction collapse isn't a physical event; it's an agent switching from one insufficient model to another after an observation. The uncertainty principle falls out because position and momentum are Fourier duals of each other, and compressing one destroys your ability to compress the other — not because nature is fuzzy, but because no program can do both jobs at once. At the top (the "m-scale"), classical physics emerges because coarse-graining is so extreme that the uncomputability wrinkles smooth out and ordinary probability theory works fine again.

The most ambitious conjecture is that the Born rule — the quantum recipe for computing probabilities from wavefunctions — can be derived from Solomonoff induction, which is the theoretically optimal way to predict sequences by averaging over all compressive models weighted by their simplicity. This would ground quantum probability in pure algorithmic reasoning rather than postulating it.

This is a research program document, not a completed result — the paper is honest about that. The objectives are clearly laid out: formalize the three-scale hierarchy using Kolmogorov structure functions, prove that Fourier duality inflates complexity (making conjugate observables algorithmically incompatible), build toy cellular-automaton universes and see whether agent-based compression recovers quantum-like rules, and test for "compression gaps" in real quantum versus thermal data. The source does not make explicit how superdeterminism avoids the standard objection that it requires conspiratorial fine-tuning of initial conditions, which remains the field's sharpest challenge.