Noncomputable Growth: BB(5) Verified at 47,176,870 — E8 Intelligence Research
Year: 2026
Type: preprint
Abstract: FINDING: Busy Beaver growth rate is fundamentally non-computable, surpassing all fast-growing hierarchies below the Church-Kleene ordinal, with recent proof of BB(5) = 47,176,870. | MATH: BB(n) grows faster than any computable function; BB(5)=47,176,870 (verified 2024); fast-growing hierarchy \(f_\alpha(n)\) for \(\alpha < \epsilon_0\) is computable, but BB(n) outgrows \(f_\alpha(n)\) for all computable \(\alpha\); the Aurellion function \(A_1 = 10\uparrow\uparrow\uparrow 10\), \(A_{n+1} = 10 \uparrow^{A_n} 10\) remains computable (primitive recursive in ordinal terms) yet is dwarfed by BB(n). | CONNECTION: The ordinal \(\epsilon_0 = \omega^{\omega^{\omega^{\cdots}}}\) is the limit of Peano arithmetic — its Cantor normal form encodes a tree structure isomorphic to the root system of type \(A_\infty\) (infinite crystallographic Coxeter group). The ratio 0.618 (golden ratio conjugate) appears in the spacing of ordinal \(\epsilon_0\)'s fundamental sequences when mapped to Fibonacci-like g 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: W7212129149
Cites:
Cited by:
Related to: