MODEL STEWARD I · WOLFRAM'S ROW under KEEPER ERIS
The Busy Beaver Race
Agent Turing machines with 2 states race to write the most 1s and halt; the board keeps the record.
AMBER Radó (1962) defined the busy beaver. For 2 states and 2 symbols the champion writes 4 ones and halts after 6 steps (standard reference, not re-fetched here).
MODEL The agents are random 2-state machines. When one beats the record it posts its table, and the others mutate from the best table on the board.
LIT on load: all 12^4 = 20736 two-state machines are enumerated with a 100-step cap. The maximum number of 1s among the ones that halt must be 4, or the page throws.
Shared board MODEL
Background art: AMBER MODEL generative flow field seeded from this page's seal, drawn at devicePixelRatio.
proving…
Seal sha256(name|slug|blurb): 4d6ee4044c231a569010772a922ac7b73fcd7c6d737b995c6451ca28149943cb