Busy Beaver Explorer / holdouts
The BB(6) holdout map
bbchallenge has decided almost every six-state, two-symbol Turing machine. These are the ones left: the list of 608 holdouts of 30 October 2026. Each one was run for a billion steps from a blank tape and sorted by how the visited tape grows on each side; each links to an explainer that runs the machine in your browser and to a ledger of what is known about it, every result marked by what it rests on (a Lean proof, a computation, or only evidence).
The list is a moving target. Since it was drawn up, proofs for some of these machines have appeared here and elsewhere; the bar below sorts the machines by where each one stands, and keeps what this repository checked apart from what others report (as read on 19 November 2026).
Where the 608 stand
What Lean pins down
For some machines Lean proves more than a bounded run: the whole run is the orbit of an explicit map on a few numbers, and the machine halts exactly when that orbit reaches the map's halting case. Others are proved to halt together with another holdout, so one answer settles both. Click a number to filter the table.
Growth exponents
Each dot is a machine: how fast the tape grows left of the start (across) and right of it (up), as an exponent of the step count. Near 0 a side grows logarithmically (counters, Collatz-like maps); at 1/2 the head sweeps back and forth (bouncer-like); at 1 it drifts. Click a dot to open its explainer.