Computation Without a Simulator

Abstract

We demonstrate that Gödelian incompleteness, far from disproving the computational nature of reality, is precisely what we should expect from a self-referential computational system — one that computes itself without external oversight. We introduce the Creatorless Computation Thesis: the universe is not being computed; it is computation.

1. The Simulation Paradox

Faizal et al. (2025) argue that Gödel's theorems prove the universe cannot be a simulation because reality requires "non-algorithmic understanding." We agree they disprove simulation (algorithmic process on an external substrate), but they draw the wrong conclusion. A self-contained computation should exhibit incompleteness because it has no meta-level from which to resolve its own self-referential paradoxes.

2. The Creatorless Computation Thesis

The laws of physics are not instructions TO a computer. They ARE the computation. There is no gap between the description and the described. The universe cannot shortcut its own execution (Computational Irreducibility). It executes cheaply in superposition and pays the thermodynamic price only when states must become definite (JIT Rendering).

3. The Inside View

Faizal et al. invoke "non-algorithmic understanding" as something beyond computation. We argue it is the **first-person perspective of computation itself.** When you analyze a system from outside, it looks algorithmic. When you are the system, you encounter Gödelian sentences you can't resolve — that is what "understanding" feels like from the inside.

Conclusion: The Dinosaur Test

Dinosaurs roamed for 165 million years with no observers. The universe computed them; nobody simulated them. The simulation debate is asking the wrong question. The right question is: "Is the universe computational, and if so, what kind?" Our answer: it is self-referential, creatorless, JIT-rendered computation. And we're complex enough to notice.