Cellular Automata

[Revised entry by Francesco Berto and Jacopo Tagliabue on August 22, 2017. Changes to: Main text, Bibliography] Cellular automata (henceforth: CA) are discrete, abstract computational systems that
Philosophy News image
[Revised entry by Francesco Berto and Jacopo Tagliabue on August 22, 2017. Changes to: Main text, Bibliography] Cellular automata (henceforth: CA) are discrete, abstract computational systems that have proved useful both as general models of complexity and as more specific representations of non-linear dynamics in a variety of scientific fields. Firstly, CA are (typically) spatially and temporally discrete: they are composed of a finite or denumerable set of homogenous, simple units, the atoms or cells. At each time unit, the cells instantiate one of a finite set of states. They evolve in parallel at...

Continue reading . . .

News source: Stanford Encyclopedia of Philosophy

blog comments powered by Disqus