The Busy Beaver Function: From BB(5) to Oracle Machines and Decidability — E8 Intelligence Research
- 1Independent Researcher, United Kingdom
Abstract
FINDING: The Busy Beaver function BB(n) defines the maximum runtime of halting n-state Turing machines; BB(5) was recently resolved via collaborative proof, and higher-order extensions via oracle machines link decidability to number-theoretic truth. | MATH: BB(5) = 47,176,870 (known value, proven 2024); BB(n) is non-computable (grows faster than any computable function); higher-order BB functions BB^α(n) based on Turing oracle machines satisfy: BB^α(n) is computable iff α is a sufficiently strong oracle, with decidability of Π₁ sentences tied to BB^α growth rates (arXiv:2507.20321). | CONNECTION: No direct geometric ratio (0.382, 0.618, 0.786, 1.618, 2.618) appears. However, the structure of BB(n) values for n=1..5 (1, 6, 21, 107, 47,176,870) shows no simple ratio pattern — but the *growth* is super-exponential, reminiscent of the divergence between rational approximations to φ (1.618) and the golden ratio's algebraic irrationality. The oracle hierarchy mirrors the arithmetical hierarc
Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Related
- The Busy Beaver Challenge: BB(5) Solved, Higher-Order Functions and Oracle Decidability — E8 Intelligence Research
- Tiling Decidability Thresholds and the Einstein Tile's Aperiodic Order — E8 Intelligence Research
- E8 Frieze-Orbus Correspondence Links Cluster Mutations to Higher‑Order Busy Beaver Growth — E8 Intelligence Research
- Collatz Conjecture via Automorphic Cayley Graphs and Decidability — E8 Intelligence Research
- Busy Beaver Outruns All Arithmetically Definable Functions — E8 Intelligence Research
BibTeX
@misc{caldin2026busy,
title = {{The Busy Beaver Function: From BB(5) to Oracle Machines and Decidability — E8 Intelligence Research}},
author = {Andrew Stewart Caldin},
howpublished = {Zenodo},
year = {2026},
month = oct,
doi = {10.5281/zenodo.23490766},
url = {https://zenodo.org/records/23490766},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - The Busy Beaver Function: From BB(5) to Oracle Machines and Decidability — E8 Intelligence Research
AU - Andrew Stewart Caldin
PY - 2026
DA - 2026/10/20
PB - Zenodo
DO - 10.5281/zenodo.23490766
UR - https://zenodo.org/records/23490766
AB - FINDING: The Busy Beaver function BB(n) defines the maximum runtime of halting n-state Turing machines; BB(5) was recently resolved via collaborative proof, and higher-order extensions via oracle machines link decidability to number-theoretic truth. | MATH: BB(5) = 47,176,870 (known value, proven 2024); BB(n) is non-computable (grows faster than any computable function); higher-order BB functions BB^α(n) based on Turing oracle machines satisfy: BB^α(n) is computable iff α is a sufficiently strong oracle, with decidability of Π₁ sentences tied to BB^α growth rates (arXiv:2507.20321). | CONNECTION: No direct geometric ratio (0.382, 0.618, 0.786, 1.618, 2.618) appears. However, the structure of BB(n) values for n=1..5 (1, 6, 21, 107, 47,176,870) shows no simple ratio pattern — but the *growth* is super-exponential, reminiscent of the divergence between rational approximations to φ (1.618) and the golden ratio's algebraic irrationality. The oracle hierarchy mirrors the arithmetical hierarc Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
ER -