Greenberg-Hastings cyclic CA: each cell holds a state in 0..n−1. State k advances to k+1 (mod n) iff a Moore neighbor already holds (k+1) mod n. Random init self-organizes into nested rotating spirals.