Notes

Chapter 3: The World of Simple Programs

Section 2: More Cellular Automata


Rule expressions [for cellular automata]

The table on the next page gives Boolean expressions for each of the elementary rules. The expressions use the minimum possible number of operators; when there are several equivalent forms, I give the most uniform and symmetrical one. Note that \[Xor] stands for Xor.


From Stephen Wolfram: A New Kind of Science [citation]