Wolfram's elementary cellular automata. Each row is computed from the previous row using a
local rule on 3-cell neighborhoods. 256 possible rules (0-255). Click rule bits above to toggle.
Rule 30: chaos from order. Rule 90: Sierpinski triangle. Rule 110: Turing-complete.