---
title: "A repeating sequence of simple rules creates a universal computer"
authors:
  - "Riz Fernando Noronha"
year: 2026
venue: "arXiv"
arxiv: "2610.09879"
doi: null
source: "https://arxiv.org/abs/2610.09879"
topics:
  - "cellular-automata"
  - "rule-110"
  - "emergence"
  - "symmetry-breaking"
seed_rank: 2261
seed_batch: "curiosity-2026-10-11"
reviewed: "2026-10-11"
pool: "maths"
relevance_score: 7
cites:
  - title: "A repeating sequence of simple rules creates a universal computer"
    url: "https://arxiv.org/abs/2610.09879"
    year: 2026
    arxiv: "2610.09879"
    doi: null
see: []
---

# A repeating sequence of simple rules creates a universal computer

## One-sentence takeaway

Alternating three trivial, left-right symmetric elementary CA rules across space emulates Turing-complete rule 110, with chirality arising only from their arrangement.

## Why it's lovely

Universality from diversity alone: no single rule computes anything interesting, yet their spatial pattern does, and random starts lock onto rule 110 over 90% of the time. A lovely toy for anyone who likes rules engines and ECS where behaviour emerges from arrangement rather than from clever individual systems.

## Key ideas

- **Spatial alternation.** Three simple symmetric rules repeated in space reproduce rule 110.
- **Emergent chirality.** The rules can't tell left from right; the arrangement breaks parity.
- **Lock-in.** Random initial conditions converge to rule-110 behaviour >90% of the time, explained via domain walls between desynchronised regions.
- **Noise scaling.** Domain-wall fraction scales with the square root of noise strength, matched by a rate equation.

## Caveats

Single-author preprint; claims about biology and QFT CA models are suggestive rather than demonstrated.

## Links

- arXiv abstract: https://arxiv.org/abs/2610.09879
- PDF: https://arxiv.org/pdf/2610.09879