Exploring the Non-Computability of the Busy Beaver Function and Its Growth Rates — E8 Intelligence Research
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
Authors
- Andrew Stewart Caldin
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-14
- DOI
- https://doi.org/10.5281/zenodo.24214407
- Primary Topic
- Computability, Logic, AI Algorithms
- Type
- preprint