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 configuration. We quantitatively and qualitatively …