A random boolean cellular automaton is a network of boolean gates where the inputs, the boolean function, and the initial state of each gate are chosen randomly. In this article, each gate has two inputs. Let a (respectively c) be the probability that the gate is assigned a constant function (respectively a noncanalyzing function, i.e., EQUIVALENCE or EXCLUSIVE OR). Previous work has shown that when a>c, with probability asymptotic to 1, the random automaton exhibits very stable behavior: Almost all of the gates stabilize, almost all of them are weak, i.e., they can be perturbed without affecting the state cycle that is entered, and the state cycle is bounded in size. This article gives evidence that the condition a = c is a threshold of chaotic behavior: with probability asymptotic to 1, almost all of the gates are still stable and weak, but the state cycle size is unbounded. In fact, the average state cycle size is superpolynomial in the number of gates. © 1995 Wiley Periodicals, Inc.
[1]
Antichaos in a class of random boolean cellular automata
,
1993,
adap-org/9304001.
[2]
Béla Bollobás,et al.
Random Graphs
,
1985
.
[3]
D. R. Heath-Brown,et al.
The Theory of the Riemann Zeta-Function
,
1987
.
[4]
Frank Harary,et al.
Graph Theory
,
2016
.
[5]
Tomasz Luczak,et al.
Stability of Vertices in Random Boolean Cellular Automata
,
1991,
Random Struct. Algorithms.
[6]
Christopher G. Langton,et al.
Computation at the edge of chaos: Phase transitions and emergent computation
,
1990
.
[7]
J. Lynch.
Probabilities of first-order sentences about unary functions
,
1985
.
[8]
Stuart A. Kauffman,et al.
Requirements for evolvability in complex systems: orderly dynamics and frozen components
,
1990
.
[9]
J. Lynch.
A Criterion for Stability in Random Boolean Cellular Automata
,
1993,
adap-org/9305001.