Papex

Open problem · Computer science · since 1962 · Open

Busy Beaver BB(6)

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

Summary

The sixth Busy Beaver value, open since Tibor Radó defined the function in 1962. BB(5) was settled in 2024 with a Rocq-checked proof. For BB(6) the best known machine (mxdys, June 2025) runs for more than 10↑↑10↑↑10↑↑8 steps, and the Cryptid Antihydra shows that settling it means solving a Collatz-like problem. Much recent work on the undecided machines has used AI assistance.

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