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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Capcarrére, M.S., Sipper, M., Tommasini, M.: Two-state, r=1 Cellular Automaton that Classifies Density. Physical Review Letters 77, 4969–4971 (1996)
Capcarrére, M.S., Sipper, M.: Necessary conditions for density classification by cellular automata. Physical Review E 64, 036113/1–036113/4 (2001)
Crutchfield, J.P., Mitchell, M.: The Evolution of Emergent Computation. Proceedings of the National Academy of Sciences 92(23), 10742–10746 (1995)
Hordijk, W., Crutchfield, J.P., Mitchell, M.: Mechanisms of Emergent Computation in Cellular Automata. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature-V, pp. 613–622. Springer, Heidelberg (1998)
Land, M.W.S., Belew, R.K.: No Two-State Ca for density classification exists. Physical Review Letters 74(25), 5148–5150 (1995)
Langton, C.G.: Studying Artificial Life With Cellular Automata. Physica D 22, 120–149 (1986)
Langton, C.G.: Computation at the edge of Chaos, Phase Transitions and Emergent Computation. Physica D 42, 12–37 (1990)
Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1996)
Mitchell, M., Hraber, P.T., Crutchfield, J.P.: Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations. Complex Systems 7, 89–130 (1993)
Mitchell, M., Crutchfield, J.P., Hraber, P.T.: Evolving Cellular Automata to Perform Computations: Mechanisms and Impediments. Physica D 75, 361–391 (1994)
Mitchell, M., Crutchfield, J.P., Das, R.: Evolving cellular automata to perform computations: A review of recent work. In: Proceedings of the First International Conference on Evolutionary Computation and Its Applications (EvCA 1996), pp. 42–55. Russian Academy of Sciences (1996)
Packard, N.H.: Adaptation toward the edge of chaos. In: Kelso, J.A.S., Mandell, A.J., Shlesinger, M.F. (eds.) Dynamic Patterns in Complex Systems, pp. 293–301. World Scientific, Singapore (1988)
Sipper, M., Capcarrère, M.S., Ronald, E.: A simple cellular automata that solves the density and ordering problems. International Journal of Modern Physics C 9(7), 899–902 (1998)
Wolfram, S.: Universality and Complexity in Cellular Automata. Physica D 10, 1–35 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gabriele, A.R. (2005). The Density Classification Problem for Multi-states Cellular Automata. In: Capcarrère, M.S., Freitas, A.A., Bentley, P.J., Johnson, C.G., Timmis, J. (eds) Advances in Artificial Life. ECAL 2005. Lecture Notes in Computer Science(), vol 3630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553090_45
Download citation
DOI: https://doi.org/10.1007/11553090_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28848-0
Online ISBN: 978-3-540-31816-3
eBook Packages: Computer ScienceComputer Science (R0)