Statistical mechanics of cellular automata

Cellular automata are used as simple mathematical models to investigate self-organization in statistical mechanics. A detailed analysis is given of ''elementary'' cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each site evolving deterministically in discrete time steps according to p definite rules involving the values of its nearest neighbors. With simple initial configurations, the cellular automata either tend to homogeneous states, or generate self-similar patterns with fractal dimensions approx. =1.59 or approx. =1.69. With ''random'' initial configurations, the irreversible character of the cellular automaton evolution leads to several self-organization phenomena. Statistical properties of the structures generated are found to lie in two universality classes, independent of the details of the initial state or the cellular automaton rules. More complicated cellular automata are briefly considered, and connections with dynamical systems theory and the formal theory of computation are discussed.

[1]  A. Turing On computable numbers, with an application to the Entscheidungsproblem , 1937, Proc. London Math. Soc..

[2]  A. Turing On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction , 1938 .

[3]  N. J. Fine,et al.  Binomial Coefficients Modulo a Prime , 1947 .


[5]  E. F. Moore Machine Models of Self-Reproduction , 1962 .

[6]  J. Neumann The General and Logical Theory of Au-tomata , 1963 .

[7]  Patrick C. Fischer,et al.  Generation of Primes by a One-Dimensional Real-Time Iterative Array , 1965, JACM.

[8]  A. J. Atrubin A One-Dimensional Real-Time Iterative Multiplier , 1965, IEEE Trans. Electron. Comput..

[9]  Aristid Lindenmayer,et al.  Mathematical Models for Cellular Interactions in Development , 1968 .

[10]  Abraham Waksman A Model of Replication , 1969, JACM.

[11]  Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines , 1969, IEEE Trans. Computers.

[12]  G. Herman Computing ability of a developmental model for filamentous organisms. , 1969, Journal of theoretical biology.

[13]  S. Kauffman Metabolic stability and epigenesis in randomly constructed genetic nets. , 1969, Journal of theoretical biology.

[14]  Periodic forests of stunted trees , 1970, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.

[15]  Periodic forests whose largest clearings are of size n ≥ 4 , 1970, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[16]  Serafino Amoroso,et al.  Tessellation Structures for Reproduction of Arbitrary Patterns , 1971, J. Comput. Syst. Sci..

[17]  Edward S. Deutsch,et al.  Thinning algorithms on rectangular, hexagonal, and triangular arrays , 1972, Commun. ACM.

[18]  S M Ulam,et al.  Some ideas and prospects in biomathematics. , 1972, Annual review of biophysics and bioengineering.

[19]  J. Hardouin-Duparc,et al.  Paradis terrestre dans l'automate cellulaire de Conway , 1974 .

[20]  Robert T. Wainwright,et al.  Life is universal! , 1974, WSC '74.

[21]  S. Rao Kosaraju On Some Open Problems in the Theory of Cellular Automata , 1974, IEEE Transactions on Computers.

[22]  H M Martinez,et al.  Automata and biology. , 1974, Annual review of biophysics and bioengineering.

[23]  Victor Aladyev,et al.  Survey of research in the theory of homogeneous structures and their applications , 1974 .

[24]  M. Douglas McIlroy The Number of 1's in Binary Integers: Bounds and Extremal Properties , 1974, SIAM J. Comput..

[25]  H. Haken Cooperative phenomena in systems far from thermal equilibrium and in nonphysical systems , 1975 .

[26]  T. Apostol Introduction to analytic number theory , 1976 .

[27]  H. Gerola,et al.  Stochastic star formation and spiral structure of galaxies. , 1977 .

[28]  J. T. Butler,et al.  The vector string descriptor as a tool in the analysis of cellular automata systems , 1977 .

[29]  Frank B. Manning,et al.  An Approach to Highly Integrated, Computer-Maintained Cellular Arrays , 1977, IEEE Transactions on Computers.

[30]  Kenneth B. Stolarsky Power and Exponential Sums of Digital Sums Related to Binomial Coefficient Parity , 1977 .

[31]  L. Schulman,et al.  Statistical mechanics of a dynamical system based on Conway's game of Life , 1978 .

[32]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[33]  H. Haken Pattern Formation by Dynamic Systems and Pattern Recognition , 1979, Springer Series in Synergetics.


[35]  J. Langer Instabilities and pattern formation in crystal growth , 1980 .

[36]  J. D. Farmer,et al.  Information Dimension and the Probabilistic Structure of Chaos , 1982 .

[37]  Y. Lévy Some remarks about computer studies of dynamical systems , 1982 .

[38]  Harold Abelson,et al.  Turtle geometry : the computer as a medium for exploring mathematics , 1983 .

[39]  A. Compagner,et al.  A special-purpose processor for the Monte Carlo simulation of ising spin systems , 1983 .

[40]  P. Grassberger New mechanism for deterministic diffusion , 1983 .

[41]  A. Odlyzko,et al.  Algebraic properties of cellular automata , 1984 .

[42]  Stephen J. Willson,et al.  Cellular automata can generate fractals , 1984, Discret. Appl. Math..