Busy beaver ones function $\Sigma(4)$

Rules and space-time diagram of the 4-state busy beaver that writes the most ones

The maximum number of 1s left on the tape by a $4$-state, 2-symbol Turing machine that halts when started on a blank tape.

Value: $13$ lower bound Checked construction upper bound Literature

History

Each bound that improved on the earlier ones, with the record of its discovery and its best evidence. A bound is discovered in the literature, or by a certificate submitted here. Its best evidence is a certificate checked here, if there is one at least as strong: a formal proof in Lean (Lean proof) or an explicit construction checked by a program (Checked construction). Otherwise it's an Attested certificate, which someone else checked with a published checker, or the Literature. Submit a certificate.

Date Bound Discovery Best evidence
1966-10 $\ge 13$ A.H. Brady, The conjectured highest scoring machines for Rado's Σ(k) for the value k = 4, IEEE Transactions on Electronic Computers EC-15 (October 1966) 802-803.
[via The Busy Beaver Competition: a historical survey, Pascal Michel]
Checked construction
Certificate busy-beaver-ones-4-lower-13, submitted by daniel-munro, 2026-11-15
[construction from A.H. Brady, The conjectured highest scoring machines for Rado's Σ(k) for the value k = 4, IEEE Transactions on Electronic Computers EC-15 (October 1966) 802-803.]
1983-04 $\le 13$ Brady, A. H. (1983). The determination of the value of Rado's noncomputable function Σ(k) for four-state Turing machines. Mathematics of Computation, 40(162), 647-665.
[via Sequence A028444 in the OEIS]
Literature