Work

Following a Six-State Busy Beaver Candidate for 97 Quadrillion Steps: Certified Tape Rules, Cross-Library Proofs, and Two Open Endings

Year: 2026
Type: preprint
Abstract: How far can we follow a machine whose entire rule table has twelve entries? We study AppC 8, a six-state machine in the Busy Beaver search. Its head crosses some stretches of tape in a predictable way. We prove what changes on each crossing and use those rules to follow the machine through more than 97 quadrillion steps from a blank tape. Whether it ever stops remains open. We identify two families of tape endings. Proving a return rule for each family would show that the machine runs forever. A second machine, AppC 7, illustrates what we can learn when the outcome is already known. We count exactly how long it takes to halt from two families of prepared tapes. Together with an existing proof that AppC 7 runs forever from blank, this shows that its blank run can never enter either family. The proofs are available in Lean, a system for checking mathematical arguments.
Language: English
Open Access status: green
OpenAlex ID: W7236817394
Cites:
Cited by:
Related to: 10