Stephen Wolframstephenwolfram.com
Publications by Stephen Wolfram * Articles * Cellular Automata * Universality and Complexity in Cellular Automata (1984)
Universality and Complexity in Cellular Automata (1984)


5. Class 1 Cellular Automata

Class 1 cellular automata evolve after a finite number of time steps from almost all initial states to a unique homogeneous state, in which all sites have the same value. Such cellular automata may be considered to evolve to simple ''limit points'' in phase space; their evolution completely destroys any information on the initial state. The spatial and temporal dimensions for such attractors are zero.

Rules for class 1 cellular automata typically take the function of eq. (2.1) to have the same value for almost all of its possible sets of arguments.

Some exceptional configurations in finite class 1 cellular automata may not evolve to a homogeneous state, but may in fact enter non-trivial cycles. The fraction of such exceptional configurations appears to decrease very rapidly with the size , suggesting that for infinite class 1 cellular automata the set of exceptional configurations is always of measure zero in the set of all possible configurations. For (legal) class 1 cellular automata whose usual final state has , (such as code 60 in fig. 1), the null configuration is exceptional for any size , and yields .

previous  l  next