A question that has vexed physicists for the past century may finally have a solution – but perhaps not the one everyone was hoping for.

A team of physicists led by Mir Faizal at the University of British Columbia has demonstrated that the universe cannot be a computer simulation, according to research published in October 2025[1].

The key findings show that reality requires non-algorithmic understanding that cannot be simulated computationally. The researchers used mathematical theorems from Gödel, Tarski, and Chaitin to prove that a complete description of reality cannot be achieved through computation alone[1:1].

The team proposes that physics needs a “Meta Theory of Everything” (MToE) - a non-algorithmic layer above the algorithmic one to determine truth from outside the mathematical system[1:2]. This would help investigate phenomena like the black hole information paradox without violating mathematical rules.

“Any simulation is inherently algorithmic – it must follow programmed rules,” said Faizal. “But since the fundamental level of reality is based on non-algorithmic understanding, the universe cannot be, and could never be, a simulation”[1:3].

Lawrence Krauss, a co-author of the study, explained: “The fundamental laws of physics cannot exist inside space and time; they create it. This signifies that any simulation, which must be utilized within a computational framework, would never fully express the true universe”[2].

The research was published in the Journal of Holography Applications in Physics[1:4].

  1. ScienceAlert - Physicists Just Ruled Out The Universe Being a Simulation ↩︎ ↩︎ ↩︎ ↩︎ ↩︎

  2. The Brighter Side - The universe is not and could never be a simulation, study finds ↩︎

  • zener_diode@feddit.org
    13·
    1 天前

    I didn’t read more than what’s in OP’s post, but I think the reason the researchers can be so sure is because there are ways to mathematically prove that something cannot be calculated by an algorithm (this is related to how we can mathematically prove that some things cannot be proven).

    One classic, simple example of this is the halting problem. It boils down to the fact that we can prove that there is no algorithm that can take any algorithm as an input and determine if that algorithm will finish (halt) after finite time.