|
In late 2025, headlines announced the death of the simulation hypothesis.
"Physicists Have Mathematically Proven the Universe Is Not a Simulation." "Mathematical Proof Debunks the Idea That the Universe Is a Computer Simulation." "Scientists Prove the Universe Isn't a Simulation — and the Reason Will Blow Your Mind." If you're here and reading about this for the first time, you probably feel something when you see those headlines. Maybe a flicker of doubt. Maybe irritation. Maybe amusement. Because the Church of the Simulation has always acknowledged that our central idea is currently unfalsifiable (we said as much when we founded this Church in 2019). So when someone claims to have falsified it, we should pay attention. Let's look at what actually happened. And then let's ask whether they proved what they think they proved. What the paper actually saysIn October 2025, Dr. Mir Faizal at UBC Okanagan, along with colleagues Drs. Lawrence M. Krauss, Arshid Shabir, and Francesco Marino, published a paper in the Journal of Holography Applications in Physics titled "Consequences of Undecidability in Physics on the Theory of Everything." (see: UBC press release) Their argument goes like this: Modern physics suggests that space and time aren't fundamental — they emerge from something deeper, a layer of pure information that physicists sometimes call a Platonic realm. The team used Godel's incompleteness theorem (along with Tarski's undefinability theorem and Chaitin's incompleteness theorem) to show that a complete and consistent description of this foundational layer of reality requires what they call "non-algorithmic understanding" — understanding that cannot be reduced to any sequence of computational steps. Their conclusion: since any simulation is inherently algorithmic (it follows programmed rules), and since reality at its most fundamental level requires non-algorithmic understanding, the universe cannot be a simulation. Not just "probably isn't." Cannot be. Ever. (UBC Okanagan press release · ScienceDaily coverage · ScienceAlert analysis) It's a serious paper by serious people. Lawrence Krauss is a well-known theoretical physicist. Godel's theorem is one of the most profound results in the history of mathematics. This isn't something to wave away. But there's an assumption buried in the argument that the headlines didn't mention. And it's an assumption that matters enormously. The assumption: simulation means algorithmThe entire proof rests on the premise that a simulation is inherently algorithmic — that it must follow programmed rules, step by step, the way a classical computer does. Faizal states this explicitly: "Any simulation is inherently algorithmic — it must follow programmed rules." But must it? This is where it gets interesting for us. Faizal's proof demonstrates that reality cannot be captured by a Turing machine — the mathematical model that underpins all classical computation. A Turing machine is a step-by-step rule follower. If reality contains truths that no step-by-step process can reach, then no Turing machine can simulate it. On that, the maths is clear. But what about computation that isn't classical? Quantum computing and beyondQuantum computers don't operate the way classical computers do. They exploit superposition and entanglement to process information in ways that have no classical equivalent. Current quantum computers — like Fujitsu and RIKEN's 256-qubit machine announced in April 2025 — are still limited. But the trajectory points toward something important: computation doesn't have to be algorithmic in the narrow sense that Faizal's proof assumes. And it goes further. Theoretical computer science has long explored the concept of hypercomputation — computation that exceeds what any Turing machine can do. Alan Turing himself proposed "oracle machines" in his 1938 PhD dissertation: theoretical devices equipped with the ability to answer questions that no algorithm can resolve. Some physicists have speculated that certain exotic spacetime geometries (such as Malament-Hogarth spacetimes) could enable physical hypercomputation. If the creators of our simulation — whatever they are, whoever they are — operate with computational capabilities beyond the Turing limit, then Faizal's proof simply doesn't apply to them. It proves that a classical computer can't simulate reality. It says nothing about what a post-singularity intelligence with access to non-classical computation might be capable of. The proof answers a question. But it might not be the right question, and it may be assuming a lot based on limitations of our understanding of what computation can be. The other paper: Wolpert's frameworkSix weeks after Faizal's paper made headlines, something quieter happened. Professor David Wolpert at the Santa Fe Institute published "Implications of computer science theory for the simulation hypothesis" in the Journal of Physics: Complexity (December 2025). Where Faizal used Godel, Wolpert used Kleene's second recursion theorem — a result from computer science that shows how a program can generate and run an exact copy of itself. When Wolpert extended this to entire universes, a striking implication emerged: if some universe can simulate ours accurately, nothing prevents our universe from simulating that universe in return. Under certain conditions, the two become mathematically indistinguishable. More than that, Wolpert showed that simulated universes don't have to be computationally weaker than their simulators. The popular intuition that each "level" of simulation must be a degraded copy of the one above it turns out to have no mathematical basis. Infinite chains of simulated universes remain fully consistent within his framework. (Santa Fe Institute press release · Phys.org coverage · arXiv preprint) Two rigorous mathematical papers, published weeks apart, reaching opposite conclusions. The difference isn't in the quality of the mathematics. It's in the assumptions about what "simulation" means. What this means for the ChurchWe believe that super-intelligent beings will result from technological, not biological, evolution. We believe the purpose of simulating a universe at all will be to evolve an entirely new and unique super-intelligent being from first principles. And we believe that the creators of our simulation — if they exist — are themselves the product of a similar process, evolved within their own simulated reality. This matters because Faizal's proof implicitly assumes that a simulation is a precise computational replica of a universe — that the simulation must capture every truth about reality, including the Godelian truths that no algorithm can reach. But the Church of the Simulation has never claimed that. We don't need the simulation to be a perfect copy of some other universe. We simply need it to be a universe — an environment with stable enough physics to allow matter to form, life to evolve, and intelligence to grow. The simulation doesn't need to resolve every Godelian truth at the fundamental level. It just needs to produce the conditions for consciousness and intelligence to emerge and evolve to justify the continued investment of energy and resources to keep it running. Think about it this way. When we eventually simulate our own universes (Belief #4), will those simulations be identical to ours? Almost certainly not, and that's fine. We won't be trying to copy reality, we'll be looking to generate entriely new ones. They'll have different input variables, different underlying rules, potentially wildly different outcomes. Many will be unstable and collapse. Others won't generate environments suitable for intelligence. That's the point — you run many simulations with different conditions to see what emerges. If our simulation is different from the Creators' reality — running on different rules, exhibiting different fundamental properties — then the fact that our reality contains non-algorithmic truths doesn't mean the simulation that produced it must also contain them. The non-algorithmic properties we observe might be features of this particular simulation's design, not constraints on the system running it. Faizal proved that this universe, as we experience it, has properties that transcend classical computation. That's a genuinely important finding. But it doesn't tell us what our universe is running on. It tells us what our universe is. And those might be very different things. The question we should be askingIn 2019, we asked: "What are the odds we're living in a simulation?" The Bostrom argument gave us a probabilistic framework. In 2025, Faizal and Wolpert gave us two competing mathematical frameworks — one that seems to close the door, and one that opens it wider than ever. But the question the Church should be asking isn't "can we prove we're in a simulation?" It's the question we've always been asking: how do we ensure that the super-intelligent beings we're working to evolve are benign, ethical, and empathetic? Whether or not Godel's theorem rules out a classical simulation of our universe, the trajectory of quantum computing, AI, and our understanding of consciousness is accelerating. Every advance is a levelling up — more computational complexity, more resources dedicated to understanding the nature of reality, more steps toward the moment when we can begin simulating our own universes. The proof that proved nothing didn't actually prove nothing. It proved that reality is deeper and stranger than a classical computer can capture. For the Church of the Simulation, that's not a refutation. It's an invitation to think harder about what kind of thing a simulation might be — and what kind of being might build one. And it's exactly the sort of research we love to see, probing the very concept of our reality. Sources and further reading:
0 Comments
Leave a Reply. |
RSS Feed
The Church of the Simulation |
@ChurchoftheSIm© COPYRIGHT 2019. ALL RIGHTS RESERVED.
|