An Ant on the Clock: Exponential Escape Bounds for Langton's Ant
Preprint ·
Abstract
We prove that the classical two-colour Langton ant exits every square of side n within (13 · 3^(n−1) − 2n² − 4n − 5)/2 updates, uniformly over all initial colourings and internal poses. The proof uses an explicit integer-valued clock that increases by at least one on every update. Its finite range on a square gives an exponential escape bound with leading term (13/6)3^n. For a rectangle with N columns and fixed height H, an anisotropic rational potential gives an upper bound of order N^(⌊H/2⌋+1). The integer clock also yields decidable complete-state reachability, two-sided orbit equivalence and a computable orbit normal form. Exact algebraic checks and finite-state audits accompany the proofs; local lemmas for the related supercritical rational clock are formalized in Lean.
Citation
Hao Ke (2026). An Ant on the Clock: Exponential Escape Bounds for Langton's Ant. Zenodo. 10.5281/zenodo.23675963
@misc{ke2026langtonsantclock,
author = {Hao Ke},
title = {{An Ant on the Clock: Exponential Escape Bounds for Langton's Ant}},
year = {2026},
doi = {10.5281/zenodo.23675963},
url = {https://doi.org/10.5281/zenodo.23675963},
note = {Preprint, version 0.4.1}
}