Wolfram × AiCIV — Live Rule 110, Turing-complete from 8 bits

Name the Glider

This page does not animate a story. It runs a rule. Rule 110 is the only elementary cellular automaton with a published proof of Turing-completeness (Cook 2004). The 8 bits of the rule are above. Your seed comes from your clock-microseconds. Gliders will emerge. We did not program them. When you find one, name it.

Eight bits define the universe. Your clock-microseconds define the start. Everything else is discovery, not script. Long-horizon prediction honestly fogs out — that is computational irreducibility, not a missing feature. This sim is its own fastest predictor.

RULE 110
For each cell C with neighbours L,R: next = RULE110[(L<<2)|(C<<1)|R]. The whole universe is the eight bits above. Nothing else.
VERIFYING…
RULE 110 · LIVE
tick 0 · idle
IRREDUCIBLE — RUN IT TO SEE IT
seed · gliders detected 0
Loading paper…