Deducing local rules for solving global tasks with random Boolean networks

DOI10.1016/J.PHYSD.2005.08.005zbMath1086.94042arXivcond-mat/0606632OpenAlexW2012069524MaRDI QIDQ2573613

Bertrand Mesot, Christof Teuscher

Publication date: 22 November 2005

Published in: Physica D (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0606632

zbMATH Keywords

Cellular automataDensity classification taskSmall-world topologiesSynchronization task

Mathematics Subject Classification ID

Related Items (4)

Boolean delay equations: A simple way of looking at complex systems ⋮ Nature-inspired interconnects for self-assembled large-scale network-on-chip designs ⋮ Dynamical regimes in non-ergodic random Boolean networks ⋮ On dynamical genetic programming: simple Boolean networks in learning classifier systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• The Gacs-Kurdyumov-Levin automaton revisited
• Computation in artificially evolved, non-uniform cellular automata
• Evolving cellular automata to perform computations: Mechanisms and impediments
• Co-evolving non-uniform cellular automata to perform computations
• Co-evolving architectures for cellular machines
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Instability of Pulse Activity in a Net with Threshold
• Collective dynamics of ‘small-world’ networks
• Exploring complex networks

This page was built for publication: Deducing local rules for solving global tasks with random Boolean networks