Each cell's next state depends on itself and its two neighbors (3 bits → 8 patterns). The rule number (0–255) gives the output for each pattern. Rule 110 is Turing complete. Rule 30 generates pseudo-random sequences. Rule 90 makes a Sierpinski triangle.