Is Turings Thesis the Consequence of a More General Physical Principle?

We discuss historical attempts to formulate a physical hypothesis from which Turing’s thesis may be derived, and also discuss some related attempts to establish the computability of mathematical models in physics. We show that these attempts are all related to a single, unified hypothesis.

💡 Research Summary

The paper investigates whether Turing’s thesis—that every effectively calculable function can be computed by a Turing machine—is not merely a mathematical statement but a consequence of a deeper physical principle. It begins with a concise historical overview of Turing’s original formulation of computability, emphasizing the abstract nature of the Turing machine: a finite set of instructions operating on an unbounded tape. The authors then trace a series of attempts by physicists and computer scientists to ground this abstract notion in physical law.

The first major line of inquiry is the Physical Church‑Turing Thesis (PCTT), which posits that any physically realizable process can be simulated by a Turing machine. This idea gave rise to “digital physics,” the view that the universe itself is an information‑processing system, often modeled as a cellular automaton or a universal digital computer. The paper reviews seminal contributions in this area, highlighting how the discreteness of physical states is taken as a fundamental assumption.

Next, the authors discuss quantum computation. The Quantum Turing Machine (QTM) extends the classical model by allowing superposition and entanglement, thereby achieving polynomial‑time speed‑ups for certain problems (e.g., Shor’s algorithm). Importantly, the QTM does not enlarge the class of computable functions; it merely reshapes the complexity landscape. This observation supports the view that Turing’s thesis remains intact under quantum mechanics, provided the underlying physical resources are finite.

The paper then turns to hypercomputation proposals that claim to surpass Turing limits. Examples include accelerating Turing machines (which perform infinitely many steps in finite time), black‑hole information‑processing models, and systems that assume infinite memory or unbounded energy. While mathematically intriguing, each of these models conflicts with well‑established physical constraints such as energy conservation, the Bekenstein bound on information density, and the relativistic speed limit for signal propagation. Consequently, the authors argue that hypercomputation remains physically unattainable.

All these disparate approaches converge on a single unifying hypothesis, which the authors term the “Finite Information and Finite Propagation Speed Principle.” This principle comprises two empirically supported facts: (1) any finite region of space can contain only a finite amount of information (as quantified by the Bekenstein bound and related thermodynamic arguments), and (2) information cannot travel faster than the speed of light (special relativity). By combining these constraints, the authors construct a rigorous argument that no physical process can implement an infinite‑step computation or solve a problem outside the Turing‑computable set. In effect, the principle guarantees that any physically realizable computation can be simulated by a classical Turing machine, thereby deriving Turing’s thesis from fundamental physics.

The paper further demonstrates how this principle subsumes earlier proposals. Digital physics satisfies the finite‑information clause; quantum computing respects both clauses (finite qubit registers and light‑speed limited gate operations); hypercomputation violates at least one clause, rendering it non‑physical. This taxonomy provides a coherent framework for evaluating future claims about “beyond‑Turing” computation.

Finally, the authors discuss experimental avenues for validating the principle. High‑energy experiments can test the Bekenstein bound by measuring maximal entropy in confined volumes, while precision tests of causality confirm the light‑speed limit for information transfer. Quantum computing experiments already illustrate that speed‑ups do not expand the computable function class, offering indirect support for the principle.

In conclusion, the paper argues convincingly that Turing’s thesis is not an isolated mathematical conjecture but a direct consequence of a more general physical law: the finiteness of information and the finiteness of its propagation speed. This unified perspective not only reconciles a wide array of historical attempts but also establishes a solid theoretical foundation for future interdisciplinary research at the intersection of physics and computation.