Busy Beaver number $BB(5)$
--MULLIGANACEOUS--, via Wikimedia Commons. Public domain.
The maximal number of steps that a $5$-state Turing machine can make on an initially blank tape before eventually halting.
Value: $47176870$ (47,176,870)
Updates
-
Lower bound: $47176870$
(47,176,870)
Reference unknown
[via Sequence A060843 in the OEIS] -
Upper bound: $47176870$
(47,176,870)
Reference unknown
[via Sequence A060843 in the OEIS]