Jump to content

Continuous spatial automaton

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Dpmuk (talk | contribs) at 22:41, 12 April 2012 (Remove text that is also at https://groups.google.com/group/comp.theory.cell-automata/browse_frm/month/2006-10?fwc=1. It seems very likely that the same person added both but as we can't prove that we need to err on the side of caution.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Continuous spatial automata, unlike cellular automata, have a continuum of locations. The state of a location is a finite number of real numbers. Time is also continuous, and the state evolves according to differential equations. One important example is reaction-diffusion textures, differential equations proposed by Alan Turing to explain how chemical reactions could create the stripes on zebras and spots on leopards. When these are approximated by CA, such CAs often yield similar patterns. MacLennan [1] considers continuous spatial automata as a model of computation.

See also

Retrieved from "https://en.wikipedia.org/w/index.php?title=Continuous_spatial_automaton&oldid=487079766"