This remark analyzes the recent debate surrounding the application of algorithmic undecidability to the physical universe. While recent arguments posit that the universe can be reduced to a completely decidable Finite State Automaton by relying on the classic Bekenstein Bound, an analysis of high-dimensional and quantum-gravitational literature reveals this assumption to be premature. By examining logarithmic corrections to black hole entropy and transfinite fractal geometry, this paper demonstrates that the physical territory is likely infinitely more complex than a discrete grid, thereby leaving the door open for fundamental undecidability in physics.
Introduction
The intersection of quantum physics, cosmology, and algorithmic information theory has recently sparked a vigorous debate regarding the fundamental computability of the universe. In 2025, Faizal et al. proposed that because formal axiomatic systems are subject to Gödelian and Turing incompleteness, any purely algorithmic "Theory of Everything" is impossible. They argued that the universe must possess non-algorithmic properties, rendering the simulation hypothesis logically invalid. Concurrently, a comprehensive review by Perales-Eceiza et al. confirmed that undecidability is pervasive in the mathematical models of modern physics, from quantum many-body systems to tensor networks, often emerging when theoretical limits are pushed to infinity.
In direct opposition to Faizal et al., Karazoupis published a preprint arguing that the introduction of undecidability into physics constitutes a fundamental category error. Karazoupis asserted that the universe is constrained by the Bekenstein Bound, which places a strict, finite limit on the amount of information that can exist within any causal horizon. By this logic, the physical universe does not possess "actual infinity." Instead, it operates strictly as a Finite State Automaton. Because Finite State Automata are completely decidable and immune to the Halting Problem, Karazoupis concluded that the universe is a logically consistent, computable machine requiring no non-algorithmic meta-theory. However, this conclusion rests entirely on the assumption that the classic, linear Bekenstein Bound is an absolute and fundamental description of quantum spacetime. An analysis of existing literature on quantum entropy and high-dimensional geometry suggests this assumption is highly vulnerable.
The Breakdown of the Finite State Automaton Assumption
The characterization of the universe as a discrete, finite informational grid relies on applying low-dimensional, macroscopic approximations to the fundamental quantum realm. Work by Castro and Granik demonstrates that the linear relationship between entropy and area in the Bekenstein-Hawking formulation is merely an effective theory recovered in the long-range limit. At the Planck scale, quantum effects introduce logarithmic and higher-order corrections to the entropy equation. Rather than resolving into a simple, discrete lattice of finite states, spacetime at the fundamental level transitions into a continuous, Cantorian-fractal geometry. Because fractals possess infinite depth and self-similarity, they require infinite precision to be perfectly described. A Finite State Automaton cannot process infinite Kolmogorov complexity, meaning the fundamental dynamics of the universe transcend simple finite computation.
This complexity is further compounded when examining the universe through the lens of extra dimensions. As elucidated by El Naschie, it is a mathematical fallacy to apply low-dimensional intuition to quantum gravity. Utilizing Dvoretzky’s Theorem on measure concentration, El Naschie highlights that in the high-dimensional spaces required by advanced physics models, geometry behaves counterintuitively, with the vast majority of "volume" concentrating near the surface. Consequently, the classic Bekenstein limit breaks down and requires an extension into a transfinite, fractal version based on E-infinity theory. If the holographic boundary of the universe is a transfinite fractal hyper-surface rather than a finite array of discrete bits, the universe inherently contains "actual infinity." The presence of actual infinity reintroduces the very algorithmic undecidability and Gödelian incompleteness that the Finite State Automaton model attempted to banish.
Conclusion: Flipping the "Map vs. Territory" Argument
The debate over whether the universe is fundamentally computable ultimately hinges on the philosophical distinction between the mathematical description of reality and reality itself. Karazoupis forcefully accused Faizal et al. of committing a category error, arguing that they mistook the infinite mathematics of their descriptive model (the map) for the strictly finite reality of the physical universe (the territory).
However, by integrating the insights of Planck-scale fractal geometry and high-dimensional measure concentration, it becomes evident that Karazoupis commits the exact same category error in reverse. He mistakes the classic Bekenstein Bound (which is merely a simplified, low-dimensional, macroscopic mathematical map) for the true quantum territory. The physics described by Castro, Granik, and El Naschie suggests that the actual quantum territory is a highly complex, continuous, transfinite fractal space where classic, discrete informational rules break down. By confusing a simplified finite map for an infinitely complex physical territory, the argument that the universe is a simple, decidable Finite State Automaton collapses. Consequently, the universe retains a level of complexity that cannot be fully captured by finite algorithms, reaffirming the likelihood that any ultimate physical theory will remain subject to fundamental undecidability.
References
Castro, C., & Granik, A. (2001). On the quantum aspects of the logarithmic corrections to the black hole entropy. Foundations of Physics, 31(7), 1157-1175.
El Naschie, M. S. (2015). The counterintuitive increase of information due to extra spacetime dimensions of a black hole and Dvoretzky's theorem. Journal of Quantum Information Science, 5(02), 41-45.
Faizal, M., Krauss, L. M., Shabir, A., & Marino, F. (2025). Consequences of Undecidability in Physics on the Theory of Everything. arXiv preprint arXiv:2507.22950.
Karazoupis, M. (2025). Resolving the "Theory of Everything" Paradox via Constructive Immanence and the Boundedness of Physical Information: A Formal Proof of Physical Decidability. Preprints.org, 202512.1495.
Perales-Eceiza, Á., Cubitt, T., Gu, M., Pérez-García, D., & Wolf, M. M. (2025). Undecidability in physics: A review. Physics Reports, 1138, 1-29.
