Answers are grounded in this paper and cite their sources.
We study the exact worst-case dependence of a future cell state on initial conditions in Elementary Cellular Automaton Rule 110. For the bi-infinite lattice, we prove that the essential initial coordinates for predicting the state of cell 0 after t synchronous updates lie in the interval [−(t − floor(t/3)), t], and that both endpoints are essential for every t ≥ 0. Consequently, the minimum contiguous observation window has exact width 2t + 1 − floor(t/3), with asymptotic growth rate 5t/3. The upper bound is established through a three-step exclusion property of the local transition rule. Sharpness is demonstrated using an explicitly constructed traveling single-bit defect on the period-four background (1011). Reproducible Python and TypeScript computations verify the finite local identities and defect recurrence. A separate computational investigation confirms that every coordinate within the proposed dependency interval is essential for all 0 ≤ t ≤ 2000, covering 3,337,668 time–position pairs using periodic backgrounds of period at most ten. The corresponding statement for arbitrary horizons remains an open conjecture. For finite periodic rings, we establish a finite-horizon criterion for persistent input essentiality and examine the divergence between decreasing image capacity and extensive dependence on initial conditions. The accompanying research artifacts include source code, computational verification records, and a Lean 4 formalization with a supplied successful compilation report.
No takes yet. Share an insight, caveat, or question.
Aleksandr Strand (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: