Evolving coupled map lattices for computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1391, Issue , 1998, Pages 151-162

  Andersson, Claes ^a   Nordahl, Mats G ^a,b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b SANTA FE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYSTAL LATTICES; GENETIC ALGORITHMS;

COUPLED MAP LATTICES; DENSITY CLASSIFICATIONS; NEAREST NEIGHBORS;

GENETIC PROGRAMMING;

EID: 84859135364     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0055935     Document Type: Conference Paper

References (19)

1. Andre, D., Bennett F. H., III and Koza, J. R.: Discovery by Genetic Programming of a Cellular Automata Rule that is Better than Any Known Rule for the Majority Classification Problem, in J. R. Koza, D. E. Goldberg, D. B. Fogel, R. L. Riolo, eds., Genetic Programming 1996: Proceedings of the First Annual Conference, 3-11 (MIT Press, 1996).
2. Capcarrere, M. S., Sipper, M., and Tomassini, M.: Two-state, r=l cellular automaton that classifies density, Physical Review Letters, 77 (1996) 4969-4971.
3. Das, R.: The Evolution of Emergent Computation in Cellular Automata, Ph. D. thesis, Colorado State University, 1996.
4. Davis, L.: private communication cited in [1].
5. Gacs, P., Kurdyumov, G. L., and Levin, L. A., One-dimensional uniform arrays that wash out finite islands, Problemy Peredachi Informatsii 14 (1978) 92-98.
6. Holden, A. V., Tucker, J. V., Zhang, H., and Poole, M. J.: Coupled map lattices as computational systems, CHAOS 2 (1992) 367-376.
7. Kaneko, K.: Physica D, 34 (1989) 1.
8. Koza, J. R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection., (MIT Press, 1992).
9. Land, M. and Belew, R. K.: No Perfect Two-State Cellular Automata for Density Classification Exists, Physical Review Letters, 74 (1995) 1548-1550.
10. Lindgren, K.: Evolutionary Phenomena in Simple Dynamics, in Artificial Life II, C. G. Langton, C. Taylor, J. D. Farmer, S. Rasmussen, eds., 295-312 (Addison- Wesley, 1992).
11. Lindgren, K. and Nordahl, M. G.: Universal Computation in a Simple One- Dimensional Cellular Automaton, Complex Systems, 4 (1990) 299-318.
12. Mitchell, M., Hraber, P. T., and J. P. Crutchfield, J. P.: Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations, Complex Systems, 7 (1993) 89-130.
13. Mitchell, M., Crutchfield, J. P., Hraber, P. T.: Evolving Cellular Automata to Perform Computations: Mechanisms and Impediments, Physica D, 75 (1994) 361-391.
14. Mitchell, M., Crutchfield, J. P., Das, R.: Evolving Cellular Automata to Perform Computations, in T. Back, D. Fogel, and Z. Michalewicz (Eds.), Handbook of Evolutionary Computation, (Oxford University Press).
15. Mitchell, M.: Computation in Cellular Automata: A Selected Review, SFI Working Paper 96-09-074, to appear in H. G. Schuster, and T. Gramms, (eds.), Nonstandard Computation, (VCH Verlagsgesellschaft, Weinheim).
16. Orponen, P. and Matamala, M.: Universal computation by finite two-dimensional coupled map lattices, Proc. Physics and Computation 1996, 243-247 (New England Complex Systems Institute, Cambridge, MA, 1996).
17. Packard, N. H.: Adaptation toward the edge of chaos, in Dynamic Patterns in Complex Systems, J. A. S. Kelso, A. J. Mandell, and M. F. Shlesinger, eds., 293-301 (World Scientific, 1988).
18. Sipper, M.: Evolution of Parallel Cellular Machines, (Springer-Verlag, 1997).
19. Wolfram, S. ed.: Theory and Applications of Cellular Automata, (World Scientific, 1986).