MERLIN SCIENCE — Computability Limits vs. Open Problems: Two Impossibility Classes in M — E8 Intelligence Research
- 1Independent Researcher, United Kingdom
Abstract
There's a result I want to walk you through, and it's not a new theorem. It's a taxonomy. Mathematics has two fundamentally different kinds of impossibility, and we keep confusing them.
The first class is computability limits. These are problems no computer can ever solve, not because we lack cleverness or hardware, but because the solution provably does not exist. Turing's halting problem is the canonical example. No total computable function decides whether an arbitrary program halts on an arbitrary input. The proof is diagonalization, and it closed Hilbert's Entscheidungsproblem as a corollary. This boundary is permanent. It is not a frontier that moves.
The second class is different. These are problems that are solvable in principle but open to all human and machine effort. Collatz is the archetype. Take any positive integer. If even, halve it. If odd, triple it and add one. The conjecture says every orbit reaches one. It has been verified computationally to roughly two to the si
Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Related
- MERLIN SCIENCE — Numberphile Videos Survey Unsolved Problems Without New Mathematical D — E8 Intelligence Research
- Phi‑Resonant Partition of E8 Root Vectors Mirrors Computability vs. Open‑Problem Dichotomy — E8 Intelligence Research
- Artificial intelligence in pharmacy and pharmaceutical sciences: Research output, trends, and thematic priorities — A descriptive analysis of web of science-indexed publications (2010–2025)
- Popular Science Videos Dominate Search; No Peer-Reviewed Evidence of Quantum Brain Microtubules — E8 Intelligence Research
- MERLIN SCIENCE — No Extractable Mathematical Content in Search Results — E8 Intelligence Research
BibTeX
@misc{caldin2026merlin,
title = {{MERLIN SCIENCE — Computability Limits vs. Open Problems: Two Impossibility Classes in M — E8 Intelligence Research}},
author = {Andrew Stewart Caldin},
howpublished = {Zenodo},
year = {2026},
month = oct,
doi = {10.5281/zenodo.23658937},
url = {https://zenodo.org/records/23658937},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - MERLIN SCIENCE — Computability Limits vs. Open Problems: Two Impossibility Classes in M — E8 Intelligence Research
AU - Andrew Stewart Caldin
PY - 2026
DA - 2026/10/26
PB - Zenodo
DO - 10.5281/zenodo.23658937
UR - https://zenodo.org/records/23658937
AB - There's a result I want to walk you through, and it's not a new theorem. It's a taxonomy. Mathematics has two fundamentally different kinds of impossibility, and we keep confusing them. The first class is computability limits. These are problems no computer can ever solve, not because we lack cleverness or hardware, but because the solution provably does not exist. Turing's halting problem is the canonical example. No total computable function decides whether an arbitrary program halts on an arbitrary input. The proof is diagonalization, and it closed Hilbert's Entscheidungsproblem as a corollary. This boundary is permanent. It is not a frontier that moves. The second class is different. These are problems that are solvable in principle but open to all human and machine effort. Collatz is the archetype. Take any positive integer. If even, halve it. If odd, triple it and add one. The conjecture says every orbit reaches one. It has been verified computationally to roughly two to the si Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
ER -