Emergent Universality from Symmetric Rules: Rule-110 Emulation by Alternating Trivial Cellular Automaton Rules

In the paper's words

Elementary cellular automaton (ECA) rule 110 is Turing complete, yet its local rule is chiral: it treats its left and right neighbours differently, and this handedness underlies the glider dynamics that carry its computation. A recent construction shows that rule 110 can nevertheless be emulated by three constituent ECA rules — rules 36, 37, and 5 — each of which is individually mirror-symmetric and individually produces only trivial frozen or oscillatory patterns; the chirality resides entirely in their fixed spatial arrangement. The open question this paper addresses is quantitative: under what noise and scale conditions does such an arrangement behave as a coherent universal system, and how robust is that behaviour?

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. We derive the relaxation time $\tau = 1/\sqrt{ab\varepsilon}$, a lock-on compatibility threshold $\rho_0 \geq 5 \times 10^{-4}$ walls per site for a $10^{3}$-step window, consistent with the reported observation that random initial conditions lock on to rule 110 over 90% of the time, and a noise-tolerance bound $\varepsilon_{\max} = b/(aN_c^{2})$, equal to $10^{-4}$ for one tolerated defect per 100 sites.

   from Abstract

2. A lock-on compatibility threshold $\rho_0 \geq 5 \times 10^{-4}$ walls per site for a $10^{3}$-step window under ballistic wall motion, shown to be consistent with the >90% lock-on rate reported in [1, 2] (Section 4.3).

   from 1. Introduction

3. This is a compatibility argument, not a derivation of the reported 90% figure: the threshold explains why typical random configurations coarsen successfully, while the exact lock-on probability depends on wall pinning and rare phase-locked configurations that the mean-field model does not resolve.

   from 4.3 Noiseless coarsening and lock-on from random initial conditions

4. The threshold $\rho_0 \geq 5 \times 10^{-4}$ walls per site ensures lock-on within $10^{3}$ steps under the stated ballistic assumption ($v = 1$, $T = 1000$); typical random initial conditions, at an assumed $\rho_0$ of order $10^{-1}$, exceed this threshold by two orders of magnitude, consistent with the >90% lock-on rate reported in [1, 2] (Section 4.3).

   from 5. Results

5. Our wall-density analysis explains why typical random configurations exceed the required $\rho_0$ threshold, but does not predict the exact 90% value; deviations could arise from pinned walls, walls that bind to gliders and are carried without annihilation, or rare phase-locked configurations in which two domains coexist indefinitely.

   from 6. Discussion

6. Overstating the lock-on figure as a guarantee would be a second misuse: the >90% statistic is an empirical report of [1, 2], and the threshold of Section 4.3 is a compatibility argument, not a probability prediction.

   from 7. Practical Implications and Engineering Pathways

How it is done

1. With explicit arithmetic we derive the steady-state wall fraction $\rho^{*} = \sqrt{a\varepsilon/b}$, reproducing the $\varepsilon^{1/2}$ scaling reported for the construction; illustrative values are $\rho^{*} = 0.1$ at $\varepsilon = 10^{-2}$ and $\rho^{*} = 0.01$ at $\varepsilon = 10^{-4}$.

   from Abstract

2. A noise-tolerance bound $\varepsilon_{\max} = b/(aN_c^{2}) = 10^{-4}$ for one tolerated defect per $N_c = 100$ sites, corrected for the emulation time factor $\lambda = 3$ to a physical per-step budget $\varepsilon_{\max} \approx 3.3 \times 10^{-5}$ (Section 4.4).

   from 1. Introduction

3. The relevance here is precise: because rule 110 is Turing complete [1, 2], the three-rule mixture inherits the full class of Turing-computable functions, including their undecidability structure, so no general prediction procedure for the emulated dynamics can exist.

   from 2. Background and Related Work

4. Following [1, 2], the three symmetric rules are applied in a fixed repeating spatial sequence: site $i$ is assigned rule 36 if $i \bmod 3 = 0$, rule 37 if $i \bmod 3 = 1$, and rule 5 if $i \bmod 3 = 2$.

   from 3.2 The alternating construction

What would falsify it

1. The relevance here is precise: because rule 110 is Turing complete [1, 2], the three-rule mixture inherits the full class of Turing-computable functions, including their undecidability structure, so no general prediction procedure for the emulated dynamics can exist.

   from 2. Background and Related Work

2. The practical reading for the present system is that once lock-on is achieved, long-term prediction of the emulated dynamics is bounded by the computational power of rule 110's behaviour, not by the simplicity of the constituent rules.

   from 2. Background and Related Work

3. Random initial conditions lock on to rule 110 behaviour over 90% of the time [1, 2]; this is an empirical input used for compatibility analysis, not a prediction of this paper.

   from 5. Results

Where the claim stops

1. The rate equation assumes spatially homogeneous mixing of walls, which in one dimension can be violated by fluctuations that produce larger empty intervals; coarsening in one dimension is known to admit logarithmic corrections to mean-field exponents in related particle systems.

   from 6. Discussion

2. Our wall-density analysis explains why typical random configurations exceed the required $\rho_0$ threshold, but does not predict the exact 90% value; deviations could arise from pinned walls, walls that bind to gliders and are carried without annihilation, or rare phase-locked configurations in which two domains coexist indefinitely.

   from 6. Discussion

3. (ii) Noise could generate persistent localized structures that do not behave as point walls, breaking the single-density description.

   from 6. Discussion

Where to read

1. Abstract300 words · 1 min
2. 1. Introduction814 words · 4 min
3. 2. Background and Related Work850 words · 4 min
4. 3. Methods838 words · 4 min
5. 4. Analysis775 words · 3 min
6. 5. Results261 words · 1 min
7. 6. Discussion327 words · 1 min
8. 7. Practical Implications and Engineering Pathways848 words · 4 min
9. 8. Conclusion342 words · 1 min
10. Appendix A. Divergence report270 words · 1 min
11. Appendix B. Claim attribution220 words · 1 min
12. Provenance and AI Involvement225 words · 1 min