No Smooth Shortcut: Why Field Equations Cannot Represent Irreducible Computation

Continuous field equations—the mathematical backbone of General Relativity, Maxwell electrodynamics, and Quantum Field Theory—operate within mathematical structures that are “tame” in the model-theoretic sense: they cannot define the integers, successor functions, or infinite discrete structure. But von Neumann machines are physical systems that demonstrably perform computations requiring exactly these structures. This creates a forced incompatibility: either field equations are incomplete for physical reality, or the laptop on your desk is not really computing. We formalize this as a minimal axiomatic proof using o-minimality theory and the von Neumann machine as empirical anchor, producing a trilemma: accept incompleteness, deny physical computation, or abandon tameness in favor of discrete mathematical structure. Crucially, a companion proof [1] establishes that the “deny computation” escape route leads to its own impossibility: a timeless block ontology that cannot accommodate the generative structure of consequential truth. Together, the two proofs form a decision tree with no cost-free exits—accepting computational irreducibility forces discrete structure; denying it eliminates becoming, computation, and contingency simultaneously.