Definition and application of a five-parameter characterization of one-dimensional cellular automata rule space

Artificial Life

Volumn 7, Issue 3, 2001, Pages 277-301

  Oliveira, Gina M B ^a   De Oliveira, Pedro P B ^a   Omar, Nizam ^b  

^a MACKENZIE PRESBYTERIAN UNIVERSITY   (Brazil)

^b INSTITUTO TECNOLÓGICO DE AERONÁUTICA   (Brazil)

Author keywords

Cellular automata; Density classification task; Dynamic behavior; Elementary rule space; Static parameters; Synchronization task

Indexed keywords

ARTICLE; CELL; MATHEMATICAL COMPUTING; NONLINEAR SYSTEM; THEORETICAL MODEL;

CELLS; MATHEMATICAL COMPUTING; MODELS, THEORETICAL; NONLINEAR DYNAMICS;

EID: 0035379439     PISSN: 10645462     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (34)

1. Andre, D., Bennett, F., III, & Koza, J. (1996). Discovery by genetic programming of a cellular automata rule that is better than any known rule for the majority classification problem. Genetic Programming 96. Palo Alto, CA: Stanford University.
2. Bedau, M., McCaskill, J., Packard, N., Rasmussen, S., Adami, C., Green, D., Ikegami, T., Kaneko, K., & Ray, T. (2000). Open problems in artificial life. Artificial Life, 6, 363-376.
3. Binder, P. M. (1993). A phase diagram for elementary cellular automata. Complex Systems, 7, 241-247.
4. Binder, P. M. (1994). Parametric ordering of complex systems. Physics Rev. E.
5. Cranny, T. (1998). Personal communication.
6. Culik II, K., Hurd, L. P., & Yu, S. (1990). Computation theoretic aspects of cellular automata. Physica D, 45, 357-378.
7. Das, R., Crutchfield, J. P., Mitchell, M., & Hanson, J. E. (1995). Evolving globally synchronized cellular automata. In L. J. Eshelman (Ed.), Proceedings of the Sixth International Conference on Genetic Algorithms (pp. 336-343). San Francisco: Morgan Kaufmann.
8. Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Boston, MA: Boston: Addison-Wesley.
9. Graham, R., Knuth, D., & Patashnik, O. (1995). Concrete mathematics - A foundation of computer science. Addison-Wesley.
10. Jen, E. (1990). Aperiodicity in one-dimensional cellular automata. Physica D, 45, 3-18.
11. Juillé, H., & Pollack, J. B. (1998). Coevolving the "ideal" trainer: Application to the discovery of cellular automata rules. In Proceedings of Genetic Programming Conference. Madison, 3.
12. Langton, C. G. (1990). Computation at the edge of chaos: Phase transitions and emergent computation. Physica D, 42, 12-37.
13. Li, W. (1991). Parameterizations of cellular automata rule space. Santa Fe Institute Tech. Report: Preprints, Santa Fe, NM.
14. Li, W. (1992). Phenomenology of nonlocal cellular automata. Journal of Statistical Physics, 68, 829-882.
15. Li, W., & Packard, N. (1990). The structure of elementary cellular automata rule space. Complex Systems, 4, 281-297.
16. Li, W., Packard, N., & Langton, C. G. (1990). Transition phenomena in cellular automata rule space. Physica D, 45, 77-94.
17. Mitchell, M. (1996). Computation in cellular automata: A selected review. In Nonstandard Computation. Weinheim: VCH Verlagsgesellschaft.
18. Mitchell, M., Crutchfield, J., & Das, R. (1996). Evolving cellular automata with genetic algorithms: A review of recent work. In Proceedings of International Conference on Evolutionary Computation and Its Applications. Moscow, 5.
19. Mitchell, M., Hraber, P., & Crutchfield, J. (1993). Revisiting the edge of chaos: Evolving cellular automata to perform computations. Complex Systems, 7, 89-130.
20. Mitchell, M., Hraber, P., & Crutchfield, J. (1994). Evolving cellular automata to perform computations: Mechanisms and impediments. Physica D, 75, 361-391.
21. Oliveira, G. M. B. (1999). Dynamics and evolution of one-dimensional cellular automata. Ph.D. thesis. Aeronautics Institute of Technology, São José dos Campos, Brazil. (In Portuguese).
22. Oliveira, G. M. B., de Oliveira, P. P. B., & Omar, N. (2000). Evolving solutions of the density classification task in 1D cellular automata, guided by a parameter-based heuristic that forecast their dynamic behavior. In M. A. Bedau, J. S. McCaskill, N. H. Packard, & S. Rasmussen (Eds.), Artificial Life VII (pp. 428-436). Cambridge, MA: MIT Press.
23. Oliveira, G. M. B., de Oliveira, P. P. B., & Omar, N. (2000). Guidelines for dynamics-based parameterization of one-dimensional cellular automata rule spaces. Complexity, 6, 63-71.
24. Packard, N. (1988). Adaptation toward the edge of chaos. In Dynamic Patterns in Complex Systems (pp. 293-301). Singapore: World Scientific.
25. Sipper, M. (1998). A simple cellular automata that solves the density and ordering problems. International Journal of Modern Physics, 9 (7).
26. Sipper, M. (1996). Co-evolving non-uniform cellular automata to perform computations. Physica D, 92, 193-208.
27. Voorhees, B. H. (2000). Some parameters characterizing cellular automata rules. Complexity. To appear.
28. Wolfram, S. (1983). Cellular automata. Los Alamos Science, 9, 2-21.
29. Wolfram, S. (1984). Computation theory of cellular automata. In Communication in Mathematical Physics, 96, 15-57.
30. Wolfram, S. (1994). Cellular automata and complexity. Boston: Addison-Wesley.
31. Wuensche, A. (1994). Complexity in one-D cellular automata: Gliders, basins of attraction and the Z parameter. Cognitive Science Research Papers: CSRP 321. Brighton, UK: University of Sussex.
32. Wuensche, A. (1999). Classifying cellular automata automatically: Finding gliders, filtering, and relating space-time patterns, attractor basins and the Z parameter. Complexity, 4, 47-66.
33. Wuensche, A., & Lesser, M. J. (1992). The global dynamics of cellular automata. Boston: Addison-Wesley.
34. Zwick, M., & Shu, H. (1995). Set-theoretic reconstructability of elementary cellular automata. Advances in Systems Science and Applications. Special Issue I:31-36.