Cellular automata (CA) are discrete dynamical systems which give simple models for many complex physical processes [1]. This paper considers CA which can be viewed as discrete approximations to molecular dynamics. In the simplest case, each link in a regular spatial lattice carries at most one "particle" with unit velocity in each direction. At each time step, each particle moves one link; those arriving at a particular site then "scatter" according to a fixed set of rules. This discrete system is well-suited to simulation on digital computers. The state of each site is represented by a few bits, and follows simple logical rules. The rules are local, so that many sites can be Updated in parallel. The simulations in this paper were performed on a Connection Machine Computer [2] which updates sites concurrently in each of 65536 Boolean processors [3].
[1]
Wolfram,et al.
Origins of randomness in physical systems.
,
1985,
Physical review letters.
[2]
W. Daniel Hillis,et al.
The connection machine
,
1985
.
[3]
R. Gatignol.
Théorie cinétique des gaz à répartition discrète de vitesses
,
1975
.
[4]
Y. Pomeau,et al.
Molecular dynamics of a classical lattice gas: Transport properties and time correlation functions
,
1976
.
[5]
Stephen Wolfram,et al.
Cellular automata as models of complexity
,
1984,
Nature.
[6]
Tommaso Toffoli,et al.
CAM: A high-performance cellular-automaton machine
,
1984
.
[7]
Wolfram,et al.
Undecidability and intractability in theoretical physics.
,
1985,
Physical review letters.