Rule 110 is an elementary 1D cellular automaton (Wolfram). Despite its simple local rule — each cell's next state depends only on itself and two neighbors — it is Turing complete (Matthew Cook, 2004). It supports gliders, stationary regions, and complex particle collisions analogous to a universal computation substrate.