Computation at the edge of chaos: Phase transitions and emergent computation

Abstract In order for computation to emerge spontaneously and become an important factor in the dynamics of a system, the material substrate must support the primitive functions required for computation: the transmission, storage, and modification of information. Under what conditions might we expect physical systems to support such computational primitives? This paper presents research on cellular automata which suggests that the optimal conditions for the support of information transmission, storage, and modification, are achieved in the vicinity of a phase transition. We observe surprising similarities between the behaviors of computations and systems near phase transitions, finding analogs of computational complexity classes and the halting problem within the phenomenology of phase transitions. We conclude that there is a fundamental connection between computation and phase transitions, especially second-order or “critical” transitions, and discuss some of the implications for our understanding of nature if such a connection is borne out.

[1]  H. Gutowitz A hierarchical classification of cellular automata , 1991 .

[2]  S. Wolfram,et al.  Two-dimensional cellular automata , 1985 .

[3]  G. Y. Vichniac,et al.  Annealed and quenched inhomogeneous cellular automata (INCA) , 1986 .

[4]  Christopher G. Langton,et al.  Studying artificial life with cellular automata , 1986 .

[5]  S. Kauffman Emergent properties in random complex automata , 1984 .

[6]  Arthur W. Burks,et al.  Essays on cellular automata , 1970 .

[7]  E. F. Codd,et al.  Cellular automata , 1968 .

[8]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[9]  Gregory J. Chaitin,et al.  On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.

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

[11]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[12]  Stephen Wolfram,et al.  Universality and complexity in cellular automata , 1983 .

[13]  P. Bak,et al.  Self-organized criticality. , 1988, Physical review. A, General physics.

[14]  C. Langton,et al.  Is there a sharp phase transition for deterministic cellular automata , 1990 .

[15]  Lila L. Gatlin,et al.  Information theory and the living system , 1972 .

[16]  E. Berlekamp,et al.  Winning Ways for Your Mathematical Plays , 1983 .

[17]  Jonathan D. Victor,et al.  Local structure theory for cellular automata , 1987 .

[18]  S. Wolfram Statistical mechanics of cellular automata , 1983 .

[19]  Alvy Ray Smith,et al.  Simple Computation-Universal Cellular Spaces , 1971, JACM.