A Criterion for Stability in Random Boolean Cellular Automata

Simple item page
dc.creatorLynch, James F.
dc.date1993-05-11
dc.date.accessioned2026-07-07T09:05:26Z
dc.date.available2026-07-07T09:05:26Z
dc.descriptionRandom 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.
dc.identifierhttps://arxiv.org/abs/adap-org/9305001
dc.identifierhttp://arxiv.org/abs/adap-org/9305001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/149679
dc.subjectAdaptation and Self-Organizing Systems
dc.titleA Criterion for Stability in Random Boolean Cellular Automata
dc.typetext

Files

Collections

arXiv