Cellular automata, originally developed by von Neuman and Ulam in the 1940’s to model biological systems, are discrete
dynamical systems that are known for their strong modeling and self-organizational properties (for examples of some
modeling properties see [3,5,22–24,26]). Cellular automata are defined on an infinite lattice and can be defined for all
dimensions. In the one-dimensional case the integer lattice Z is used. In the two-dimensional case, Z Z. An example of
a two-dimensional cellular automata is John Conway’s ever popular ‘‘Game of Life’’1. Probably the most interesting aspect
about cellular automata is that which seems to conflict our physical systems. While physical systems tend to maximal entropy,
even starting with complete disorder, forward evolution of cellular automata can generate highly organized structure.
Cellular automata, originally developed by von Neuman and Ulam in the 1940’s to model biological systems, are discretedynamical systems that are known for their strong modeling and self-organizational properties (for examples of somemodeling properties see [3,5,22–24,26]). Cellular automata are defined on an infinite lattice and can be defined for alldimensions. In the one-dimensional case the integer lattice Z is used. In the two-dimensional case, Z Z. An example ofa two-dimensional cellular automata is John Conway’s ever popular ‘‘Game of Life’’1. Probably the most interesting aspectabout cellular automata is that which seems to conflict our physical systems. While physical systems tend to maximal entropy,even starting with complete disorder, forward evolution of cellular automata can generate highly organized structure.
การแปล กรุณารอสักครู่..