Mechanisms of emergent computation in cellular automata
We introduce a class of embedded-particle models for describing the emergent computational strategies observed in cellular automata (CAs) that were evolved for performing certain computational tasks. The models are evaluated by comparing their estimated performances with the actual performances of the CAs they model. The results show, via a close quantitative agreement, that the embedded-particle framework captures the main information processing mechanisms of the emergent computation that arise in these evolved CAs.
KeywordsCellular Automaton Initial Configuration Regular Language Finite Automaton Regular Domain
Unable to display preview. Download preview PDF.
- 5.Das, R., Mitchell, M., Crutchfield, J. P.: A genetic algorithm discovers particle-based computation in cellular automata. Parallel Problem Solving from Nature—PPSN III, Davidor, Y., Schwefel, H.-P., Männer, R., eds. (1994) 244–353.Google Scholar
- 6.Das, R., Crutchfield, J. P., Mitchell, M., Hanson, J. E.: Evolving globally synchronized cellular automata. Proceedings of the Sixth International Conference on Genetic Algorithms, Eshelman, L. ed., (1995) 336–343.Google Scholar
- 9.Wolfram, S.: Cellular Automata and Complexity. Addison-Wesley, 1994.Google Scholar