~/topics/cellular-automata
Cellular automata
-
Two flanks, one gate: Rule 30 through CA Trace Explorer
A single-parent counterfactual test explains how the two moving-edge recurrences treat a diagonal’s memory differently.
-
Rule 30 and the “or more” question
The left-edge recurrence, a reported billion-step result, and the evidence still needed to reproduce that result.