Wolfram’s Rule 34 in XKCD [closed]
Wolfram has organized the 256 possible 1-D cellular automata based on nearest neighbors in this way: RULES: 0: 0 0 0 1: 0 0 1 2: 0 1 0 3: 0 1 1 4: 1 0 0 5: 1 0 1 6: 1 1 0 7: 1 1 1 If you’re evaluating a stage in … Read more