Busy Beaver BB(3,3)
What is the largest number of steps a halting 3-state, 3-symbol Turing machine can run, starting from a blank tape?
Summary
The Busy Beaver value for Turing machines with three states and three symbols. The longest-running machine proved to halt, found by Terry and Shawn Ligocki in 2007, runs for 119,112,334,170,342,541 steps. The Cryptid Bigfoot, found in October 2023, shows that settling BB(3,3) 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.