Wolfram's Rule 110 is Turing complete (Cook 2004). Each cell's next state depends on itself and two neighbors — 8 patterns, 8 outputs encoded in 110 = 01101110₂. Universal computation from local rules.
Rule 110: patterns interact to form gliders and complex structures — proof of Turing completeness (Cook 2004).