Patterns of Growth

  • Kendall PrestonJr.
  • Michael J. B. Duff
Part of the Advanced Applications in Pattern Recognition book series (AAPR)

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.)

Keywords

Cellular Automaton Processing Element Input Pattern Digital Computer Transition Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1984

Authors and Affiliations

  • Kendall PrestonJr.
    • 1
    • 2
    • 3
  • Michael J. B. Duff
    • 4
  1. 1.Carnegie-Mellon UniversityPittsburghUSA
  2. 2.University of PittsburghPittsburghUSA
  3. 3.Kensal ConsultingTusconUSA
  4. 4.University College LondonLondonEngland

Personalised recommendations