Automated discovery in complex systems

tags
Complex Systems

Evolutionary algorithms and CAs

Evolutionary algorithms have been used to find Cellular automata rules with specific behavior (Mitchell et al. 1996; Sapin, Bailleux, and Jean-Jacques 2003) . The objective is to optimize a fitness function (majority of cells, presence of gliders and periodic patterns, etc.).

Bibliography

Mitchell, Melanie, Hyde Park Road, Rajarshi Das, and P O Box. 1996. “Evolving Cellular Automata with Genetic Algorithms: A Review of Recent Work.” In Proceedings of the First International Conference on Evolutionary Computation and Its Applications, 14.

Sapin, Emmanuel, Olivier Bailleux, and Chabrier Jean-Jacques. 2003. “Research of a Cellular Automaton Simulating Logic Gates by Evolutionary Algorithms.” In Genetic Programming, edited by G. Goos, J. Hartmanis, J. van Leeuwen, Conor Ryan, Terence Soule, Maarten Keijzer, Edward Tsang, Riccardo Poli, and Ernesto Costa, 2610:414–23. Berlin, Heidelberg: Springer Berlin Heidelberg.


← Back to Notes