Abstract
Cellular automata (CA) are dynamical systems that are discrete in space and time, operate on a uniform, regular grid, and are characterized by local interactions. Each point in a regular spatial grid, called a cell, can have any one of a finite number of states. The states of the cells in the grid are updated according to a local rule — the state of a cell at a given time depends only on its own state and the states of its nearby neighbors at the previous time step. All cells on the grid are updated synchronously [3]. Cellular automata were conceptualized by John von Neumann [1] and Stanislaw Marcin Ulam [2] in the 1940s. von Neumann was mainly interested in self-reproducing automata, while Ulam liked to invent pattern games using a computer at Los Alamos. CA were next studied by several other scientists, but they got very popular thanks to John Horton Conway, who in 1970 defined and with his students explored the famous Conway’s Game of Life, and Martin Gardner, who published the game in Mathematical Games column in Scientific American the same year. The articles in the Mathematical Games column were a direct inspiration for programming MCell.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
