Cellular automaton - Wikipedia, the free encyclopedia
A cellular automaton (pl. cellular automata , abbrev. CA ) is a discrete model studied in computability theory, mathematics, physics, theoretical biology and microstructure modeling. It consists...
en.wikipedia.org/wiki/Cellular_automaton
Texture Garden, for growing algorithmic textures. ... [Reaction-diffusion cellular automata] - in [Texture Garden] ... Self-reproducing cellular automata...
cell-auto.com/ cell-auto.com/
A cellular automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set ...
mathworld.wolfram.com/CellularAutomaton.html mathworld.wolfram.com/CellularAutomaton.html
The simplest class of one-dimensional cellular automata. Elementary cellular automata have two possible values for each cell (0 or 1), and rules that depend ...
mathworld.wolfram.com/ElementaryCellularAutomaton.html mathworld.wolfram.com/ElementaryCellularAutomaton.html
Cellular automata are self-generating computer graphics movies. The most important near-term application of cellular automata will be to commercial computer graphics; in five years you won't be able to watch television for an hour without seeing some kind of CA.
www.fourmilab.ch/cellab/ www.fourmilab.ch/cellab/
Daniel Dennett, "Real Patterns" in Brainchildren: Essays on Designing Minds [Using cellular automata to explicate the nature of patterns, emergent properties, and a great deal else besides. See my review of the book]
cscs.umich.edu/~crshalizi/notebooks/cellular-automata.h... cscs.umich.edu/~crshalizi/notebooks/cellular-automata.html
Cellular Automata as Simple Self-Organizing ; Systems (1982) ... Statistical Mechanics of Cellular Automata (1983) ... Cellular Automata (1983)
www.stephenwolfram.com/publications/articles/ca/
Cellular Automata Examples ... The applet on this page is a simple Greenburg Hastings type cellular automaton (CA). In a CA, each cell has a finite number of states, which are updated based on its neighbours and its own state the previous time step.
www.cnd.mcgill.ca/bios/bub/CAs.html
Cellular automata software ... What is the status of the Cellular Automata FAQ? ... Definitions - and general references on cellular automata;
cafaq.com/
Cells per row ... A simulation of cell behaviour based on four simple rules. RULES: Loneliness - a cell with less than 2 neighbours dies. Overcrowding - a cell with more than ; 3 neighbours dies. Reproduction - an empty cell with 3 neighbours comes ... Statis - a cell with exactly 2 neighbours comtinues unchanged.
grant.robinson.name/projects/cellularAutomata/blueCells... grant.robinson.name/projects/cellularAutomata/blueCells.htm