On the threshold of chaos in random boolean cellular automata

DOI10.1002/rsa.3240060212zbMath0819.68082arXivadap-org/9309001OpenAlexW2027048638MaRDI QIDQ4697815

James F. Lynch

Publication date: 8 August 1995

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/adap-org/9309001

zbMATH Keywords

random Boolean cellular automaton

Mathematics Subject Classification ID

Combinatorial probability (60C05) Cellular automata (computational aspects) (68Q80)

Related Items (6)

The number and probability of canalizing functions ⋮ Nested canalyzing, unate cascade, and polynomial functions ⋮ On the number of driver nodes for controlling a Boolean network when the targets are restricted to attractors ⋮ Attractors in Boolean networks: a tutorial ⋮ Critical points for random Boolean networks ⋮ Reconstruction of Kauffman networks applying trees

Cites Work

• Unnamed Item
• Antichaos in a class of random Boolean cellular automata
• Probabilities of First-Order Sentences about Unary Functions
• Stability of vertices in random boolean cellular automata

This page was built for publication: On the threshold of chaos in random boolean cellular automata