Verifying BB(5) and Oracle-Based Uncomputable Growth in Number Theory — E8 Intelligence Research

Q: What does this research mean for the field?

The Busy Beaver function BB(5) is verified to be 47,176,870, and its higher-order oracle-based extensions link the decidability of number-theoretic statements to uncomputable growth rates within the ordinal hierarchy. Novelty: ClaimNovelty.CONFIRMATORY. Consensus alignment: ConsensusAlignment.NEUTRAL.

Andrew Stewart Caldin

doi:10.5281/zenodo.22325382

September 5, 2026Open Access

Verifying BB(5) and Oracle-Based Uncomputable Growth in Number Theory — E8 Intelligence Research

View Full Paper

Ask AI

Bookmark

Share

Key Points

To verify the maximum runtime of halting five-state Turing machines and explore how higher-order oracle-based Busy Beaver functions link to number-theoretic decidability and root systems.
Evaluated collaborative verification data from the Busy Beaver Challenge for the 5-state Turing machine parameter space.
Constructed higher-order Busy Beaver functions BB^α(n) using Turing oracle machines across the ordinal hierarchy α < ε₀.
Confirmed BB(5) equals exactly 47,176,870 halting steps.
Showed that a number-theoretic statement φ is decidable if and only if BB^α(n) is computable for an ordinal α < ε₀ corresponding to the fast-growing hierarchy F_α(n).
Identified recursive structural similarities between the ordinal hierarchy α < ε₀ and root systems like the 240-root E₈ lattice, despite finding no direct geometric ratios.

No abstract yet

We only have this paper's title and publication details.

Read it at the source

Implication

Theoretical analysis demonstrates finite runtime verification in five-state Turing machines, indicating fundamental connections between uncomputable growth hierarchies and decidability.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Andrew Stewart Caldin (2026) studied this question.

synapsesocial.com/papers/6a9e85c4c3034f961570e2ab https://doi.org/10.5281/zenodo.22325382

View Full Paper

Ask AI

Bookmark

Share

Verifying BB(5) and Oracle-Based Uncomputable Growth in Number Theory — E8 Intelligence Research

Key Points

No abstract yet

Implication

Discussion

Cite This Study

Verifying BB(5) and Oracle-Based Uncomputable Growth in Number Theory — E8 Intelligence Research

Key Points

No abstract yet

Implication

Discussion

Cite This Study

Keep reading

Keep reading