2005 | OriginalPaper | Chapter
Evolving Sequential Combinations of Elementary Cellular Automata Rules
Authors : Claudio L. M. Martins, Pedro P. B. de Oliveira
Published in: Advances in Artificial Life
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Performing computations with cellular automata, individually or arranged in space or time, opens up new conceptual issues in emergent, artificial life type forms of computation, and opens up the possibility of novel technological advances. Here, a methodology for combining sequences of elementary cellular automata is presented, in order to perform a given computation. The problem at study is the well-known density classification task that consists of determining the most frequent bit in a binary string. The methodology relies on an evolutionary algorithm, together with analyses driven by background knowledge on dynamical behaviour of the rules and their parametric estimates, as well as those associated with the formal behaviour characterisation of the rules involved. The resulting methodology builds upon a previous approach available in the literature, and shows its efficacy by leading to 2 rule combinations already known, and to additional 26, apparently unknown so far.