Exploring the Non-Computability of the Busy Beaver Function and Its Growth Rates — E8 Intelligence Research
Year: 2026
Type: preprint
Abstract: FINDING: The Busy Beaver function exemplifies the limits of computation, yielding values that are non-computable. | MATH: BB(n) where BB(n) is the output of the busy beaver function for n states, e.g., BB(4) = 107. | CONNECTION: The function demonstrates growth rates exceeding exponential functions but lacks direct geometric harmony connections. | DEPTH: 8. This discovery highlights the vastness of numbers and the existence of non-computable values, thereby expanding the understanding of computational limits. 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: W7226741223
