Abstract
Cellular Automata (CAs) are discrete dynamic systems composed of a large set of simple units organised into a regular one-, two- or multi-dimensional grid which update their state on the basis of their previous state and the state of a small number of neighbouring cells. CAs have been traditionally used for image processing and for hydrodynamics, thermodynamics and turbulence modelling. More recently CAs have also been used as mechanisms to study emergent computation, the phenomenon in which a large set of simple interacting elements with little information produce a complex coordinated information processing behaviour. In this paper, using the power of genetic algorithms, we study the ability of CAs to perform two very important forms of emergent computation: pattern association and associative memory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Toffoli, T., Margolus, N., 1987, Cellular Automata Machines: A new Environment for Modelling, MIT Press, London.
Wolfram, S., 1994, Cellular Automata and Complexity: Collected Papers, Addison-Wesley.
Packard, N.H., 1988, Adaptation toward the edge of chaos, in Kelso, J.A.S, Mandell, A.J., Shlesinger, M.F., Dynamic Patterns in Complex Systems, pp. 293–301, World Scientific, Singapore.
Mitchell, M., Hraber, P.T., Crutchfield, J.P., 1993, Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations, Complex Systems, 7, pp. 89–130.
Das, R., Mitchell, M., Crutchfield J.P., 1994, A Genetic Algorithm Discovers Particle-Based Computation in Cellular Automata, Proceedings of the Third Parallel Problem-Solving From Nature Conference.
Andre, D., Bennett III, F.H., Koza, J.R., 1996, Discovery by Genetic Programming of a Cellular Automata Rule that is Better than any Known Rule for the Majority Classification Problem, in Koza, J.R, Goldberg, D.E., Fogel, D.B., Riolo, R.L., Genetic Programming 1996: Proceedings of the First Annual Conference, MIT Press.
Hopfield, J.J., 1982, Neural Networks and Physical Systems with Emergent Collective Computational Abilities, Proceedings of the National Academy of Sciences, 79, pp. 2554–2558.
Jen, E., 1986, “Invariant Strings and Pattern-Recognizing Properties of One-Dimensional Cellular Automata,” Journal of Statistical Physics, 43.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag London
About this paper
Cite this paper
Chady, M., Poli, R. (1998). Evolution of Cellular-automaton-based Associative Memories. In: Chawdhry, P.K., Roy, R., Pant, R.K. (eds) Soft Computing in Engineering Design and Manufacturing. Springer, London. https://doi.org/10.1007/978-1-4471-0427-8_5
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0427-8_5
Publisher Name: Springer, London
Print ISBN: 978-3-540-76214-0
Online ISBN: 978-1-4471-0427-8
eBook Packages: Springer Book Archive