Abstract
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.)
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer Science+Business Media New York
About this chapter
Cite this chapter
Preston, K., Duff, M.J.B. (1984). Patterns of Growth. In: Modern Cellular Automata. Advanced Applications in Pattern Recognition. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-0393-8_12
Download citation
DOI: https://doi.org/10.1007/978-1-4899-0393-8_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-0395-2
Online ISBN: 978-1-4899-0393-8
eBook Packages: Springer Book Archive