Abstract
This paper presents a method of using genetic programming to seek new cellular automata that perform computational tasks. Two genetic algorithms are used : the first one discovers a rule supporting gliders and the second one modifies this rule in such a way that some components appear allowing it to simulate logic gates. The results show that the genetic programming is a promising tool for the search of cellular automata with specific behaviors, and thus can prove to be decisive for discovering new automata supporting universal computation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bays C.: Candidates for the game of life in three dimensions. In Complex Systems, 1 (1987), 373–400.
Berlekamp E.,. Conway J. H, Guy R.: Winning Ways for your mathematical plays. Academic press, New York
Das R., Mitchell M., Crutchfield J. P.: Evolving Cellular Automata with Genetic Algorithms: A Review of Recent Work. In Proceedings of the First International Conference on Evolutionary Computation and Its Applications (EvCA’96), Russian Academy of Sciences, 1996.
Das R., Mitchell M., Crutchfield J. P.: The Evolutionary Design of Collective Computation in Cellular Automata. SFI Working Paper 98-09-080.
Dytham C., Shorrocks B.: Selection, Patches and Genetic Variation: A Cellular Automata Modeling Drosophila Populations. In Evolutionary Ecology, 6 (1992) 342–351
Epstein I. R.: Spiral Waves in Chemistry and Biology. In Science, 252 (1991) 67.
Ermentrout, G. Lotti, and l. Margara,“Cellular Automata Approaches to Biological Modeling,” Journal of Theoretical Biology, 60 (1993) 97–133
Gardner M.: The fantastic combinaisons of John Conway’s new solitaire game ≪ Life ≫,.In Scientific American, (1970)
Gardner M.: On Cellular Automata, Self-reproduction, the Garden of Eden, and the Game of Life. In Scientific American, 224 (1971) 112–118
Hordijk W., Crutchfield J. P., Mitchell M.: Mechanisms of Emergent Computation in Cellular Automata., Parallel Problem Solving from Nature-V, 613–622, Springer-Verlag, 1998.
Wolfram S.: Universality and complexity in cellular automata. In Physica D, 10 (1984) 1–35.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sapin, E., Bailleux, O., Jean-Jacques, C. (2003). Research of a Cellular Automaton Simulating Logic Gates by Evolutionary Algorithms. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E., Poli, R., Costa, E. (eds) Genetic Programming. EuroGP 2003. Lecture Notes in Computer Science, vol 2610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36599-0_39
Download citation
DOI: https://doi.org/10.1007/3-540-36599-0_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00971-9
Online ISBN: 978-3-540-36599-0
eBook Packages: Springer Book Archive