Undecidability as a Fundamental Limit on Computation, Knowledge, and Physical Systems — E8 Intelligence Research
Year: 2026
Type: preprint
Abstract: FINDING: Undecidable problems, such as the halting problem and those arising from Gödel's incompleteness, impose fundamental limits on computation and formal knowledge, revealing that certain physical systems may also harbor undecidable properties. | MATH: No specific equations or constants emerge from the provided sources; the core mathematical essence is the concept of undecidability itself—a property of formal systems where a statement cannot be proven true or false within that system. The halting problem is defined as: given a description of an arbitrary program and a finite input, decide whether the program finishes running or continues forever. Its undecidability is proven via a diagonalization argument, not a numeric constant. | CONNECTION: No direct geometric ratios (0.382, 0.618, 0.786, 1.618, 2.618) or base-60 mathematics are present. However, the structure of undecidability can be linked to the concept of *incommensurability* in geometry—just as the diagonal of a square is i Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Author: Caldin, Andrew Stewart
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7171858407
Cites:
Cited by:
Related to: