What you're seeing
A grid of cells, each on or off. You plant a small, lopsided shape — an arrow, an F, a glider, or something you draw yourself — and let the rule run. For most steps the pattern dissolves into a churning, triangular Sierpiński texture that looks nothing like your seed. But at every step that is a power of two, the noise resolves into clean, exact copies of the original: four perfect clones, sitting at equal distances north, south, east, and west of where the seed was. Run it longer and those four copies march further apart, doubling their separation at each power-of-two moment, while the space between them fills with fractal churn. The shape was copied, and the copies are real — that is why we use an asymmetric seed, so your eye can confirm a clone is a true translated copy and not a trick of symmetry.
The rule
Each cell looks at its four orthogonal neighbors — north, east, south, west — counts how many are on, and becomes on if that count is odd, off if it is even. That is the entire rule: the parity, or exclusive-OR (XOR), of the four neighbors. A cell does not include itself. (Switch the neighborhood control to Moore to take the parity of all eight neighbors instead — it replicates too, into eight copies.)
Why does such a plain rule copy everything? Because XOR is linear over the two-element field GF(2): the future of a configuration is exactly the XOR-superposition of the futures of its individual live cells, with no cross-terms. So it is enough to understand one lone cell. A single on-cell, after \(2^n\) steps, becomes exactly four cells at distance \(2^n\) due north, south, east, and west — you can verify this in the sim with the Single cell seed. By linearity, a whole pattern is just the sum of its cells, so the whole pattern is faithfully reproduced as four copies at those same four offsets. This is Fredkin's replication theorem, and Amoroso and Cooper proved the general statement: certain additive (parity) cellular automata reproduce arbitrary patterns. The grid here wraps around at the edges (a torus); it is sized large so the receding copies don't fold back and overlap for a long while.
Why it matters
Self-reproduction is the signature of life: a thing that builds a copy of itself. In the 1940s John von Neumann asked whether a machine could do this without shrinking or magic — and proved it could, designing a universal constructor in a 29-state cellular automaton that reads a description tape, builds the machine that tape describes, then copies the tape into its child. That architecture — a description, plus machinery that reads and executes it — is exactly how a living cell works: DNA is the tape, the ribosome is the constructor.
This is where an honest distinction matters, due to Christopher Langton. The parity rule above is trivial self-replication: the rule's linear structure does the duplicating for free, and the copies carry no instructions — nothing in a copy describes how to make a copy; the ambient physics simply happens to clone whatever is present. Non-trivial self-replication is the hard kind, where the configuration itself contains a description of how to build itself together with the machinery to read and execute that description. Von Neumann's constructor is non-trivial; so are Langton's self-reproducing loops (1984), which store their own blueprint in a circulating signal and are far simpler than von Neumann's; and so is biological reproduction. This entry shows the easy, elegant kind. Life is the hard kind, and the gap between them — how a trivially-copied pattern could ever cross over into a pattern that encodes and executes its own description — is one of the deep open questions of artificial life.
In the wild
- DNA replication and cell division. The real thing, and firmly the non-trivial kind: the genome is a literal description, copied by polymerase and executed by the ribosome. The parity rule is not a model of this — it is the cartoon that makes the contrast sharp.
- Von Neumann's universal constructor (1940s, published 1966). The first proof that self-reproduction is possible for machines, and the conceptual blueprint — description-plus-constructor — that biology turned out to embody.
- Langton's loops (1984). A small, genuinely self-reproducing CA pattern that stores its description in a loop rather than on a tape — the first self-reproducer simple enough to watch reproduce on a screen, yet still non-trivial.
- Self-replicating machines in theory. From von Neumann's "kinematic" robots that gather parts and build copies, to proposed self-replicating factories and spacecraft. These remain largely theoretical; honest accounting says no engineered machine yet reproduces the way a cell does.
- Game of Life replicators. Life can host non-trivial self-replicators (the Gemini pattern, 2010), but they are enormous and elaborate — the opposite extreme from this one-line parity rule. (See Conway's Game of Life.)
Try this
- Set the seed to Paint your own and drag out a lopsided shape, then press play and watch your drawing clone itself. Drawing redefines the seed, so the "copy" frames re-flag against whatever you made.
- Use the Single cell seed to see the atom of the whole effect: one cell becomes four, at distance 2, 4, 8, 16… due north/south/east/west — the seed of every other copy.
- Lower the speed to 1 step/frame and watch the rhythm: churning Sierpiński noise that grows denser and denser, then snaps back to clean copies exactly on the power-of-two steps, then churns again.
- Switch the neighborhood to Moore and watch the same seed resolve into eight copies instead of four — a different rule, the same linear magic.
References
- von Neumann, J. (1966). Theory of Self-Reproducing Automata (edited and completed by A. W. Burks). University of Illinois Press. (The universal constructor; description-plus-constructor architecture.)
- Langton, C. G. (1984). "Self-reproduction in cellular automata." Physica D: Nonlinear Phenomena 10(1–2), 135–144. (The trivial-vs-non-trivial distinction and the self-reproducing loop.)
- Amoroso, S. & Cooper, G. (1971). "Tessellation structures for reproduction of arbitrary patterns." Journal of Computer and System Sciences 5(5), 455–464. (Additive/parity CA reproduce arbitrary patterns.)
- Wolfram, S. (2002). A New Kind of Science. Wolfram Media. (Discusses additive/parity cellular automata and the replication of patterns, e.g. the rule-90 / Pascal-mod-2 family.)