Busy beaver ones function $\Sigma(2)$

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

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

Value: $4$ 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
undated $\ge 4$ Reference unknown
[via Sequence A028444 in the OEIS]
Checked construction
Certificate busy-beaver-ones-2-lower-4, submitted by daniel-munro, 2026-11-15
undated $\le 4$ Reference unknown
[via Sequence A028444 in the OEIS]
Literature