Glossary · Term

Rule 110

← all terms

Definition

A famous simple rule for evolving rows of cells that turns out to be capable of universal computation.

A one-dimensional, two-state cellular automaton proven Turing-complete; used as a clean test bed for isolating sequential reasoning depth from storage capacity in long-context model experiments.

Mentioned in 1 episode

  1. 085
    Why Long-Context Models Might Need Compute, Not Capacity, Before Eviction