No Smooth Shortcut: Why Field Equations Cannot Represent Irreducible Computation
Fuente:
Zenodo
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Recurso digital |
| Publié: |
Zenodo
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866901251287941120 |
|---|---|
| author | Chancellor, Shammah |
| author_facet | Chancellor, Shammah |
| contents | <p>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 [<span>1</span>] 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.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_18569920 |
| institution | Zenodo |
| language | |
| publishDate | 2026 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | No Smooth Shortcut: Why Field Equations Cannot Represent Irreducible Computation Chancellor, Shammah Discrete Time Continuous Field Theory Representational Adequacy Computational Irreducibility Physical Modeling Foundations of Physics Infinity in Physics Spacetime Ontology Generative Processes <p>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 [<span>1</span>] 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.</p> |
| title | No Smooth Shortcut: Why Field Equations Cannot Represent Irreducible Computation |
| topic | Discrete Time Continuous Field Theory Representational Adequacy Computational Irreducibility Physical Modeling Foundations of Physics Infinity in Physics Spacetime Ontology Generative Processes |
| url | https://doi.org/10.5281/zenodo.18569920 |