# Deducing local rules for solving global tasks with random Boolean networks

@article{Mesot2005DeducingLR, title={Deducing local rules for solving global tasks with random Boolean networks}, author={Bertrand Mesot and Christof Teuscher}, journal={Physica D: Nonlinear Phenomena}, year={2005}, volume={211}, pages={88-106} }

Abstract It has been shown that uniform as well as non-uniform cellular automata (CA) can be evolved to perform certain computational tasks. Random Boolean networks are a generalization of two-state cellular automata, where the interconnection topology and the cell’s rules are specified at random. Here we present a novel analytical approach to find the local rules of random Boolean networks (RBNs) to solve the global density classification and the synchronization task from any initial… Expand

#### Figures, Tables, and Topics from this paper

#### 36 Citations

Title: Evolving Cellular Automata with Genetic Algorithms: Analyzing Asynchronous Updates and Small World Topologies

- 2008

An abstract of the thesis of Davy Stevenson for the Master of Science in Computer Science presented February 15, 2008. Title: Evolving Cellular Automata with Genetic Algorithms: Analyzing… Expand

A low level analysis of Cellular Automata and Random Boolean Networks as a computational architecture

- Computer Science
- 2011

This study presents a low level hardware analysis of Cellular Automata (CA) networks and Random Boolean Networks using a framework which generates the HDL code and netlist of these networks for various network parameters and provides valuable information to help designers make decisions for various performance parameters. Expand

On the Effect of Topology on Learning and Generalization in Random Automata Networks

- Computer Science
- 2011

This work shows experimentally that there exists a critical connectivity Kc that improves the generalization and adaptation in networks, and explains why adaptation improves at this critical connectivity by showing that the network ensemble manifests maximal topological diversity near Kc. Expand

Information processing in two-dimensional cellular automata

- Computer Science
- 2011

It is demonstrated why an accurate model of information processing in two-dimensional cellular automata cannot be constructed from the space-time behavior of these structures, as well as several approaches to automatically identify the spatiotemporal structures with information content. Expand

Dynamical regimes in non-ergodic random Boolean networks

- Computer Science, Mathematics
- Natural Computing
- 2016

It is shown here that a more detailed study, based on the properties of system's attractors, can provide information that makes it possible to predict with higher precision important properties, such as system’s response to gene knock-out. Expand

Assessing random dynamical network architectures for nanoelectronics

- Computer Science, Physics
- 2008 IEEE International Symposium on Nanoscale Architectures
- 2008

This paper will assess random dynamical networks, namely random Boolean networks (RBNs) and random threshold networks (RTNs), as alternative computing architectures and models for future information processing devices and illustrate that they offer superior properties over classical CA-based architectures. Expand

Dynamical regimes and learning properties of evolved Boolean networks

- Computer Science
- Neurocomputing
- 2013

By employing meta heuristic methods, it is shown that by employing metaheuristic methods BNs can be trained to deal with two notable tasks, namely, the problem of controlling the BN's trajectory to match a set of requirements and the density classification problem. Expand

On the Effect of Heterogeneity on the Dynamics and Performance of Dynamical Networks

- Computer Science
- 2012

This thesis aims to study the effect of heterogeneity in the dynamics of physical systems that pertains to information processing and introduces the model parameters to characterize the heterogeneity of components in RBN and LSM networks. Expand

Density classification performance and ergodicity of the Gacs-Kurdyumov-Levin cellular automaton model IV.

- Mathematics, Medicine
- Physical review. E
- 2018

This work characterized the density classification performance of Gacs, Kurdyumov, and Levin's model IV, a four-state cellular automaton with three absorbing states-only two of which are attractive-by numerical simulations, and found signs of an ergodic-nonergodic phase transition at some small finite positive level of noise. Expand

Towards Intelligent Biological Control: Controlling Boolean Networks with Boolean Networks

- Computer Science
- EvoApplications
- 2016

An alternative approach that uses evolutionary algorithms to design GRNs that can control other GRNs is considered, demonstrating that Boolean networks can be evolved to control trajectories within other Boolean networks. Expand

#### References

SHOWING 1-10 OF 65 REFERENCES

Co-evolving architectures for cellular machines

- Computer Science
- 1997

This paper generalizes on a second aspect of CAs, namely their standard, homogeneous connectivity, and studies non-standard architectures, where each cell has a small, identical number of connections, yet not necessarily from its most immediate neighboring cells. Expand

Co-evolving non-uniform cellular automata to perform computations

- Mathematics
- 1996

A major impediment of cellular automata (CA) stems from the difficulty of utilizing their complex behavior to perform useful computations. Recent studies by Packard and Mitchell et al. have shown… Expand

Quasi-Uniform Computation-Universal Cellular Automata

- Computer Science
- ECAL
- 1995

The computation-universal system presented here is simpler than previous ones, and is embedded in the minimal possible two-dimensional cellular space, namely 2-state, 5-neighbor (which is insufficient for universal computation in the uniform model). Expand

Emergent properties in random complex automata

- Mathematics
- 1984

Abstract Studies of large, randomly assembled binary (Boolean) node automata have demonstrated that such systems can spontaneously exhibit enormously ordered dynamical behavior. An important approach… Expand

Evolving cellular automata to perform computations: mechanisms and impediments

- Mathematics
- 1994

Abstract We present results from experiments in which a genetic algorithm (GA) was used to evolve cellular automata (CAs) to perform a particular computational task - one-dimensional density… Expand

Random Boolean network model exhibiting deterministic chaos.

- Mathematics, Medicine
- Physical review. E, Statistical, nonlinear, and soft matter physics
- 2004

This paper considers a simple Boolean network with N nodes, each node's state at time t being determined by a certain number of parent nodes, which may vary from one node to another, and provides a generalization of the formula for the probability of finding a node in state 1 at a time t. Expand

Asynchronous, irregular automata nets: the path not taken.

- Computer Science, Medicine
- Bio Systems
- 2000

A primary objective is to demonstrate that irregular asynchronous automata nets, as opposed to cellular automata, are a realistic approach to modeling biological information processing. Expand

Evolving Cellular Automata with Genetic Algorithms: A Review of Recent Work

- Computer Science
- 2000

The work described here is the first step in employing GAs to engineer useful emergent computation in decentralized multi-processor systems and is also a step in understanding how an evolutionary process can produce complex systems with sophisticated collective computational abilities. Expand

Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations

- Computer Science, Physics
- Complex Syst.
- 1993

An experiment similar to one performed by Packard (1988), in which a genetic algorithm is used to evolve cellular automata to perform a particular computational task, demonstrates how symmetry breaking can impede the evolution toward higher computational capability. Expand

Computation in Artificially Evolved, Non-Uniform Cellular Automata

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1999

The algorithm is presented and it is demonstrated that high-performance systems can be evolved to perform two non-trivial computational tasks, density and random number generation. Expand