Cliff Reiter
Abstract
Cellular automata are collections of cells arranged in some manner such that each cell contains a value that is updated from generation to generation according to a local rule. The Game of Life [1-5,7,15] is perhaps the best known cellular automaton. It is based upon a rectangular arrangement of cells that are either 0 or 1, along with simple rules of evolution: if a cell is 0 and has exactly 3 immediate neighbors then it becomes a 1; if a cell is 0 and has exactly 2 or 3 immediate neighbors that are 1, then the cell remains 1; otherwise, the cell becomes or remains 0. The Game of Life is incredibly intriguing, giving rise to complex behavior that is visually stimulating, mathematically interesting and, moreover, it is known to be capable of universal computation. Despite the fact that at a basic level it was designed to model alive and dead cells, it is primarily a toy model in the sense that it does not model any physical behavior well.
- E. Berlekamp, J. Conway, and R. Guy, Winning Ways For Your Mathematical Plays, Academic Press, 1982.Google Scholar
- P. Callahan, Patterns, Programs, and Links for Conway's Game of Life, http://www.radicaleye.com/lifepage/lifepage.html#catbackGoogle Scholar
- P. Callahan, What is the Game of Life? http://www.math.com/students/wonders/life/life.htmlGoogle Scholar
- M. Gardner, The fantastic combinations of John Conway's new solitare game of "life", Scientific American 223, (1970) 120--123.Google ScholarCross Ref
- M. Gardner, On cellular automata, self-replication, the Garden of Eden and the game "life", Scientific American, 224 4(1971) 112--117.Google Scholar
- M. Gerhardt and H. Schuster, A cellular Automaton describing the formation of spatially ordered structures in chemical systems, Physica D 36(1989) 209--221.Google ScholarCross Ref
- A. Hensel, Conway's Game of Life, http://www.ibiblio.org/lifepatterns/Google Scholar
- Andrew Ilachinski, Cellular Automata, A Discrete Universe, World Scientific, 2001. Google ScholarDigital Library
- Kunihiko Kaneko and Ichiro Tsuda, Complex Systems: Chaos and Beyond, Springer, English translation, 2000.Google Scholar
- A. Pechenkin, How to Understand the History of the Belousov-Zhabotinsky Reaction, http://www.ut.ee/flfi/ISPC/Pechenkin.doc.Google Scholar
- C. A. Reiter, Fractals, Visualization and J, second edition, Jsoftware, 2000.Google Scholar
- C. A. Reiter, Scripts for Special Fall 2005 update to Fractals, Visualization, and J, http://www.lafayette.edu/~reiterc/j/fvj2/index.html.Google Scholar
- Z. X. Reiter, C. A. Reiter, Image 3 Addon, http://www.jsoftware.com.Google Scholar
- Steven H. Strogatz, Nonlinear Dynamics and Chaos, Perseus Books Publishing, LLC, 1994.Google Scholar
- J. Summers, Jason's Life Page, http://entropymine.com/jason/life/.Google Scholar
Recommendations
A concurrent solution for intra-cell flow path layouts and I/O point locations of cells in a cellular manufacturing system
In this paper, we study the I/O (Input/Output) point location problem and the intra-cell flow path layout problem of cells in a cellular manufacturing system. Traditional approaches have often solved these two problems as separate problems, despite they ...
Apoptosis detection for adherent cell populations in time-lapse phase-contrast microscopy images
MICCAI'12: Proceedings of the 15th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part IThe detection of apoptosis, or programmed cell death, is important to understand the underlying mechanism of cell development. At present, apoptosis detection resorts to fluorescence or colorimetric assays, which may affect cell behavior and thus not ...
Comments