A Criterion for Stability in Random Boolean Cellular Automata
adap-org
2008-02-03 v1 Adaptation and Self-Organizing Systems
Abstract
Random boolean cellular automata are investigated, where each gate has two randomly chosen inputs and is randomly assigned a boolean function of its inputs. The effect of non-uniform distributions on the choice of the boolean functions is considered. The main results are that if the gates are more likely to be assigned constant functions than non-canalyzing functions, then with very high probability, the automaton will exhibit very stable behavior: most of the gates will stabilize, and the state cycles will be bounded in size.
Cite
@article{arxiv.adap-org/9305001,
title = {A Criterion for Stability in Random Boolean Cellular Automata},
author = {James F. Lynch},
journal= {arXiv preprint arXiv:adap-org/9305001},
year = {2008}
}