Elementary cellular automata
n
Discrete elements in a line
n
Binary state for each
element
n
Step through time
n
Each element changes
according to current state +
states of two neighbors
n
Rule table
n
111 -> 0
n
110 -> 1
n
101 -> 0
n
100 -> 1
n
011 -> 1
n
010 -> 0
n
001 -> 1
n
000 -> 0
n
256 possible rules
n
32 “legal”
n
Reflection symmetry
n
Leave 0 state unchanged