Upper bound:
OpenBB5.upper_boundUpper bound on the fifth Busy Beaver value: . This is the main difficulty: all 5-state machines are enumerated in Tree Normal Form (181,385,789 machines) and their halting behaviour decided, with 13 sporadic machines handled by individual non-halting proofs.
import Mathlib import Definitions.Def_FCP_BusyBeaver
import Mathlib import Definitions.Def_FCP_BusyBeaver namespace BB5 /-- Upper bound for the fifth Busy Beaver value (Lemma BB5_upperbound): S(5) ≤ 47,176,870. This is the main difficulty of the paper: every 5-state machine is enumerated in Tree Normal Form (181,385,789 machines) and its halting behaviour decided by the decider pipeline, with 13 sporadic machines handled by individual non-halting proofs. -/ theorem upper_bound : FCP.BusyBeaver.BB 5 ≤ 47176870 := 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 non-strict inequality . Unfolding , this is , where a is a machine with a transition table on states over the two tape symbols, is the blank-tape start configuration (state , head at integer , every cell ) formed with a proof of , and means while for every , iterating one step at a time (a step halts on a none next-state entry, otherwise writes the symbol, moves the head one cell right or left per the direction Boolean, and enters the next state). In words: every halting step count achieved by any 5-state, 2-symbol machine started on the blank tape is at most , i.e. no such machine halts after more than transitions, and the supremum of all such counts is bounded above by that number. The inequality is non-strict and, being about a supremum, concerns all members of the defining set rather than a single machine; is satisfiable and adds no restriction. The declaration is closed by sorry.