Three coupled cellular automata. Layer A runs freely. Layer B's rule is rewritten by Layer A's output. Layer C's rule is rewritten by Layer B's output. Each generation produces a 1D waveform. Sweeping through all 256 rules navigates Wolfram's four complexity classes — from silence through melody through noise to universal computation.
Rule 30: Class III chaotic · Rule 110: Class IV universal computation (Turing complete) ·
Rule 90: Sierpiński triangle · Rule 4/8: Class II periodic ·
Rules 0/255: Class I dead silence