arXiv · 2512.11807
Provability vs. Execution: A Comment on "Consequences of Undecidability in Physics on the Theory of Everything"
Abstract
Recent work by Faizal et al. (2025) claims that G\"odelian undecidability of non-algorithmic truths in our universe imply the impossibility of a formal, algorithmic simulation of the universe. This paper clarifies the distinction between epistemic incompleteness: limits on what can be proven within a formal system, and ontological incompleteness: limits on what can exist or be computed by that system. Using Conway's Game of Life as a Turing-complete example, I demonstrate that undecidability constrains provability but not computability or execution. Unless physical phenomena require the resolution of undecidable propositions, incompleteness alone does not imply a guaranteed failure in execution. Thus, the claim that the universe cannot be simulated lacks empirical and logical justification without evidence of hypercomputation in nature.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Evan Redden. 2025-11-14. Provability vs. Execution: A Comment on "Consequences of Undecidability in Physics on the Theory of Everything". https://arxiv.org/abs/2512.11807
Cite the original work for its findings. Save a collection to share your selection of sources.