The density classification problem for multi-states cellular automata

Authors:
Anna Rosa Gabriele
Affiliations:
Università della Calabria, Arcavacata di Rende, (CS), Italy
Venue:
ECAL'05 Proceedings of the 8th European conference on Advances in Artificial Life
Year:
2005

Citing 5
Cited 0

Studying artificial life with cellular automata

Physica D
Computation at the edge of chaos: phase transitions and emergent computation

CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
Evolving cellular automata to perform computations: mechanisms and impediments

Proceedings of the NATO advanced research workshop and EGS topical workshop on Chaotic advection, tracer dynamics and turbulent dispersion
An introduction to genetic algorithms

An introduction to genetic algorithms
Mechanisms of Emergent Computation in Cellular Automata

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the results of three experiments, in which a genetic algorithm evolves one-dimensional cellular automata (CA), in order to perform the classical main task, are reported. The used systems are not elementary CA but they have a higher number of states. Our aim is to verify if the main-task results are similar to those obtained with elementary CA. Our results confirm that there is a substantial homogeneity.