Simon’s new take on cellular automata:

Some results would make fancy knitting patters!

In case you wonder, what on earth are cellular automata:

A cellular automaton (pl. cellular automata, abbrev. CA) is studied in computer science, mathematics, physics, theoretical biology and microstructure modeling.

A cellular automaton consists of a regular grid of *cells*, each in one of a finite number of *states*, such as *on* and *off* . The grid can be in any finite number of dimensions. For each cell, a set of cells called its *neighborhood* is defined relative to the specified cell. An initial state (time *t* = 0) is selected by assigning a state for each cell. A new *generation* is created (advancing *t* by 1), according to some fixed *rule *(generally, a mathematical function)^{} that determines the new state of each cell in terms of the current state of the cell and the states of the cells in its neighborhood.

The concept was originally discovered in the 1940s by Stanislaw Ulam and John von Neumann while they were contemporaries at Los Alamos National Laboratory. While studied by some throughout the 1950s and 1960s, it was not until the 1970s and Conway’s Game of Life, a two-dimensional cellular automaton, that interest in the subject expanded beyond academia. In the 1980s, Stephen Wolfram engaged in a systematic study of one-dimensional cellular automata, or what he calls elementary cellular automata; his research assistant Matthew Cook showed that one of these rules is Turing-complete. Wolfram published *A New Kind of Science* in 2002, claiming that cellular automata have applications in many fields of science. These include computer processors and cryptography. (Wikipedia)