Evolving Asynchronous and Scalable Non-uniform Cellular Automata
We have previously shown that non-uniform cellular automata (CA) can be evolved to perform computational tasks, using the cellular programming algorithm. In this paper we focus on two novel issues, namely, the evolution of asynchronous CAs, and the scalability of evolved synchronous systems. We find that asynchrony presents a more difficult case for evolution though good CAs can still be attained. We describe an empirically derived scaling procedure by which successful CAs of any size may be obtained from a particular evolved system. Our motivation for this study stems in part from our desire to attain realistic systems that axe more amenable to implementation as “evolving ware,” evolware.
KeywordsCellular Automaton Grid Size Cellular Automaton Computational Task Logical Step
Unable to display preview. Download preview PDF.
- H. Bersini and V. Detour. Asynchrony induces stability in cellular automata based models. In R. A. Brooks and P. Maes, editors, Artificial Life IV, pages 382–387, Cambridge, Massachusetts, 1994. The MIT Press.Google Scholar
- R. Das, J. P. Crutchfield, M. Mitchell, and J. E. Hanson. Evolving globally synchronized cellular automata. In L. J. Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 336–343, San Francisco, CA, 1995. Morgan Kaufmann.Google Scholar
- M. Sipper. The evolution of parallel cellular machines: Toward evolware. BioSystems, 1996. (to appear).Google Scholar
- M. Sipper. Evolving uniform and non-uniform cellular automata networks. In D. Stauffer, editor, Annual Reviews of Computational Physics, volume V. World Scientific, Singapore, 1997. (to appear).Google Scholar
- M. Sipper and E. Ruppin. Co-evolving architectures for cellular machines. Physica D, 1996. (to appear).Google Scholar