Papex

Open problem · Computer science · Open

Busy Beaver BB(2,5)

What is the largest number of steps a halting 2-state, 5-symbol Turing machine can run, starting from a blank tape?

Summary

The Busy Beaver value for Turing machines with two states and five symbols. The best known machine, found by Daniel Yuan in June 2024, runs for more than 10^(10^(10^3,314,360)) steps. The Cryptid Hydra, found in April 2024, shows that settling BB(2,5) means solving a Collatz-like problem.

Source

Open, as listed by Busy Beaver Challenge · bbchallenge wiki. Checked 06 Nov 2026.

The status is the source’s. Papex does not decide whether a problem is solved.

Records on this problem

No public record addresses this problem yet.

More in Computing