Can Quantum Mechanics Become Computable? Toward a Rational, Finite, and Deterministic Framework for Physical Law
Ed Gerck · Preprints.org · 2025
We present a proposal addressing the foundational question of whether quantum mechanics can be reformulated in a computable way. Using a rational, and deterministic framework based on arbitrary-length integers and algebra. Departing from traditional models that rely on real numbers, complex amplitudes, and probabilistic interpretations, we propose a rational-number-based formulation of quantum mechanics. We demonstrate this approach through the exact eigenvalue formulation of the Schrödinger equation, a harmonization of general relativity with QM, and a reworking of Shor's algorithm using only finite, rational arithmetic (ISA). Our results suggest that quantum theory can be grounded in exact, computable logic that aligns with physical measurement, quantum computing, and existing digital hardware.