Research of Complexity in Cellular Automata through Evolutionary Algorithms

This paper presents an evolutionary approach to searching for cellular automata that accept gliders. The proposed technique is based on a specific fitness function taking into account spatial evolution, the number of living cells, and the presence of gliders. The results show that the genetic algorithm is a promising tool for finding cellular automata with specific behaviors, and then could prove to be decisive for identifying new automata that support universal computation.