Evolving cellular automata with genetic algorithms: A review of recent work (1996)
Cached
Download Links
| Venue: | In Proceedings of the First International Conference on Evolutionary Computation and Its Applications (EvCA'96). Russian Academy of Sciences |
| Citations: | 42 - 1 self |
BibTeX
@INPROCEEDINGS{Mitchell96evolvingcellular,
author = {Melanie Mitchell and James P. Crutchfield and Rajarshi Das},
title = {Evolving cellular automata with genetic algorithms: A review of recent work},
booktitle = {In Proceedings of the First International Conference on Evolutionary Computation and Its Applications (EvCA'96). Russian Academy of Sciences},
year = {1996}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We review recent work done by our group on applying genetic algorithms (GAs) to the design of cellular automata (CAs) that can perform computations requiring global coordination. A GA was used to evolve CAs for two computational tasks: density classification and synchronization. In both cases, the GA discovered rules that gave rise to sophisticated emergent computational strategies. These strategies can be analyzed using a “computational mechanics ” framework in which “particles ” carry information and interactions between particles effects information processing. This framework can also be used to explain the process by which the strategies were designed by the GA. The work described here is a first step in employing GAs to engineer useful emergent computation in decentralized multi-processor systems. It is also a first step in understanding how an evolutionary process can produce complex systems with sophisticated collective computational abilities.
