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

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.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24370901
Primary Topic
Computability, Logic, AI Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

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

Darryl Novotny
Zenodo (CERN European Organization for Nuclear Research)
Computability, Logic, AI Algorithms
preprint

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

Darryl Novotny
preprint en

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.

Zenodo (CERN European Organization for Nuclear Research)
Computability, Logic, AI Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon