Difference between revisions of "Cellular automaton"
Jump to navigation
Jump to search
m |
|||
| Line 6: | Line 6: | ||
The lattice is a grid filled with cells, each cell is uniquely identified by its coordinates and value. The cellular automaton evolves via the transition function with respect to the discrete time variable. | The lattice is a grid filled with cells, each cell is uniquely identified by its coordinates and value. The cellular automaton evolves via the transition function with respect to the discrete time variable. | ||
| + | |||
| + | Lattice-Gas Cellular Automatons can be used to model physical systems such as fluid dynamics. ''Mathematica'' uses a cellular automatons as a random number generator. | ||
| + | |||
| + | ==Further Readings== | ||
| + | :[http://www.stephenwolfram.com/publications/articles/ca/86-fluids/index.html Cellular Automaton Fluids: Basic Theory], Stephen Wolfram, 1986. | ||
| + | :[http://www.stephenwolfram.com/publications/articles/ca/86-random/index.html Random Sequence Generation by Cellular Automata], Stephen Wolfram, 1986. | ||
| + | :[http://www.stephenwolfram.com/publications/articles/ca/85-thermodynamics/index.html Thermodynamics and Hydrodynamics of Cellular Automata], Stephen Wolfram, 1985. | ||
| + | :[http://www.stephenwolfram.com/publications/articles/ca/85-cryptography/index.html Cryptography with Cellular Automata], Stephen Wolfram, 1986. | ||
[[category:mathematics]] | [[category:mathematics]] | ||
[[category:computer science]] | [[category:computer science]] | ||
Revision as of 09:37, April 20, 2007
A cellular automaton is a 4-tuple , where:
- is a lattice.
- is a finite set of cell states or values.
- is the finite neighborhood.
- is the transition function.
The lattice is a grid filled with cells, each cell is uniquely identified by its coordinates and value. The cellular automaton evolves via the transition function with respect to the discrete time variable.
Lattice-Gas Cellular Automatons can be used to model physical systems such as fluid dynamics. Mathematica uses a cellular automatons as a random number generator.
Further Readings
- Cellular Automaton Fluids: Basic Theory, Stephen Wolfram, 1986.
- Random Sequence Generation by Cellular Automata, Stephen Wolfram, 1986.
- Thermodynamics and Hydrodynamics of Cellular Automata, Stephen Wolfram, 1985.
- Cryptography with Cellular Automata, Stephen Wolfram, 1986.