Theorem 6.3:
OpenBB5.S4_valueConfirmation of Brady's 1983 result: , re-established by the S(4) decider pipeline of Coq-BB5.
import Mathlib import Definitions.Def_FCP_BusyBeaver
import Mathlib import Definitions.Def_FCP_BusyBeaver namespace BB5 /-- Theorem 6.3 of arXiv:2509.12337 (confirmation of Brady's 1983 result): S(4) = 107. This is a smaller Busy Beaver value that Coq-BB5 re-establishes with its S(4) decider pipeline. -/ theorem S4_value : FCP.BusyBeaver.BB 4 = 107 := by sorry end BB5
Read-back
What the Lean code literally says, in plain math · claude-opus-6
This theorem, closed by sorry, asserts the equality , where is the bundle's maximum-shifts busy-beaver function. Unfolding it, , so the assertion is that this supremum equals . Here a is a machine with a transition table on states () and the two tape symbols; is the blank-tape start configuration (state , head at integer position , tape identically ), the hypothesis being the proof that state index is valid for a 4-state machine; and means together with for all , where and performs one further single step (read current state and symbol under the head; halt if the next-state field is none, otherwise write the symbol, shift the head one cell right or left per the direction Boolean, and move to the next state). In words: the largest number of transitions that any 4-state, 2-symbol machine performs from the blank tape before halting is exactly . Since holds the existential hypothesis imposes no restriction; at the same definition yields the empty set and value , a degeneracy that does not arise here. For the machine type is finite and the defining set is finite, so the supremum is a maximum, though the definition does not prove this. The declaration is closed by sorry.