Continuous automaton
From Wikipedia, the free encyclopedia
A continuous automaton can be described as a cellular automaton extended so the valid states a cell can take are not just discrete (for example, the states consist of integers between 0 and 3), but continuous, for example, the real number range [0,1]. The cells however remain discretely separated from each other .
Such automata can be used to model certain physical reactions more closely, such as diffusion. One such diffusion model could conceivably consist of a transition function based on the average values of the neighbourhood of the cell. Many implementations of Finite Element Analysis (FEA) can be thought of as continuous automatons, though this degree of abstraction away from the physics of the problem is probably inappropriate.
 |
This computer-related article is a stub. You can help Wikipedia by expanding it. |
