Threshold of complexity in 2D binary Cellular Automata found through Polynomial CNNs

Pazienza, Giovanni Egidio; Gómez-Ramı́rez, E.

doi:10.1109/cnna.2010.5430277

Cited by 1 publication

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Their outbreak was in 1970, when Gardner popularized the renowned Game of Life invented by Conway [14]. Some recent studies about the Game of Life can be found in [7,15,13,32,43]. Cellular automata have been applied in several fields, like modeling of traffic [5,10,27], pattern recognition [17,40], cryptography [28] and many others.…”

Section: Introductionmentioning

confidence: 99%

A symbiosis between cellular automata and genetic algorithms

Cerruti

Dutto

Murru

2020

Chaos, Solitons & Fractals

View full text Add to dashboard Cite

Cellular automata are systems which use a rule to describe the evolution of a population in a discrete lattice, while genetic algorithms are procedures designed to find solutions to optimization problems inspired by the process of natural selection. In this paper, we introduce an original implementation of a cellular automaton whose rules use a fitness function to select for each cell the best mate to reproduce and a crossover operator to determine the resulting offspring. This new system, with a proper definition, can be both a cellular automaton and a genetic algorithm. We show that in our system the Conway's Game of Life can be easily implemented and, consequently, it is capable of universal computing. Moreover two generalizations of the Game of Life are created and also implemented with it. Finally, we use our system for studying and implementing the prisoner's dilemma and rock-paper-scissors games, showing very interesting behaviors and configurations (e.g., gliders) inside these games.

show abstract