Patterns of Growth
No book on cellular automata would be complete without a chapter on patterns of growth, especially the most popular generator of these patterns, namely, John Horton Conway’s cellular automata game “Life” (see Gardner, 1971). Long before the invention of Conway’s Life, Moore (1968) at the United States Bureau of Standards and Ulam (1962) at the Los Alamos Scientific Laboratory were analyzing growth patterns using digital computers. Moore and Ulam used the digital computer to simulate the action of a cellular automaton consisting of an array of processing elements far simpler than the 29-state processing elements of von Neumann (1951). They wrote computer programs to simulate an array of two-state processing elements exhibiting either dl-connectedness (Ulam) or d2-connectedness (Moore). (See equations 6.1 and 6.2.)
KeywordsCellular Automaton Processing Element Input Pattern Digital Computer Transition Rule
Unable to display preview. Download preview PDF.