Skip to main content
SpringerLink
Log in

Searching for One-Dimensional Cellular Automata in the Absence of a priori Information

  • Conference paper
  • First Online:
Advances in Artificial Life (ECAL 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2159))

Included in the following conference series:

Abstract

Various investigations have been carried out on the computational power of cellular automata (CA), with concentrated efforts in the study of one-dimensional CA. One of the approaches is the use of genetic algorithms (GA) to look for CA with a predefined computational behavior. We have previously shown a set of parameters that can be effective in helping forecast CA dynamic behavior; here, they are used as an heuristic to guide the GA search, by biasing selection, mutation and crossover, in the context of the Grouping Task (GT) for one-dimensional CA. Since GT is a new task, no a priori knowledge about its solutions is presently available; even then, the incorporation of the parameter-based heuristic entails a significant improvement over the results achieved by the plain genetic search.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andre, D.; Bennett III, F. and Koza, J. (1996). Evolution of Intricate Long-Distance Communication Signals in Cellular Automata Using Programming. In: Proceedings of Artificial Life V Conference. Japan, 5.

    Google Scholar 

  2. Binder, P.M. (1993). A Phase Diagram for Elementary Cellular Automata. Complex Systems, 7:. 241–247.

    Google Scholar 

  3. Culik II, K.; Hurd, L. P. and Yu, S. (1990). Computation Theoretic Aspects of Cellular Automata. Physica D, 45:357–378.

    Article  MATH  MathSciNet  Google Scholar 

  4. Das, R.; Crutchfield, J.; Mitchell, M. and Hanson, J. (1995). Evolving Globally Synchronised Cellular Automata. In: Proceedings of International Conference on Genetic Algorithms, San Francisco, 6.

    Google Scholar 

  5. Fonseca, C. M. and Fleming, P. J. (1997). Multiobjective Optimization. In Thomas Bäck, David B. Fogel, and Zbigniew Michalewicz, editors, Handbook of Evolutionary Computation, volume 1, pages C4.5:1–C4.5:9. Oxford University Press.

    Google Scholar 

  6. Juillé, H. and Pollack, J.B. (1998). Coevolving the “Ideal” Trainer: Application to the Discovery of Cellular Automata Rules. In: Proceedings of Genetic Programming Conference. Madison, 3.

    Google Scholar 

  7. Langton, C.G. (1990). Computation at the Edge of Chaos: Phase Transitions and Emergent Computation. Physica D, 42:12–37.

    Article  MathSciNet  Google Scholar 

  8. Li, W. and Packard, N. (1990). The Structure of Elementary Cellular Automata Rule Space. Complex Systems, 4:281–297.

    MathSciNet  Google Scholar 

  9. Li, W. (1992). Phenomenology of Non-local Cellular Automata. Journal of Statistical Physics, 68: 829–882.

    Article  MATH  MathSciNet  Google Scholar 

  10. Mitchell, M.; Hraber, P. and Crutchfield, J. (1993). Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations. Complex Systems, 7: 89–130.

    MATH  Google Scholar 

  11. Mitchell, M. (1996). Computation in Cellular Automata: A Selected Review. In: Nonstan-dard Computation. Weinheim: VCH Verlagsgesellschaft.

    Google Scholar 

  12. Mitchell, M.; Crutchfield, J.; and 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.

    Google Scholar 

  13. Oliveira, G.M.B., de Oliveira, P.P.B., and Omar, N. (2000). Evolving solutions of the density classification task in 1D cellular automata, guided by parameters that estimate their dynamic behaviour. In: M. Bedau; J. McCaskill; N. Packard and S. Rasmussen, eds. Artificial Life VII, 428–436, MIT Press.

    Google Scholar 

  14. Oliveira, G.M.B., de Oliveira, P.P.B., and Omar, N. (2001a). Guidelines for Dynamics-Based Parameterization of One-dimensional Cellular Automata Rule Spaces. Complexity, 6(2): 63–71, John-Wiley, 2000.

    Article  MathSciNet  Google Scholar 

  15. Oliveira, G.M.B., de Oliveira, P.P.B., and Omar, N. (2001b). Definition and Applications of a Five-Parameter Characterization of One-Dimensional Cellular Automata Rule Space. Artificial Life, under review.

    Google Scholar 

  16. Oliveira, G.M.B., de Oliveira, P.P.B., and Omar, N. (2001c). Improving Genetic Search for One-Dimensional Cellular Automata, Using Heuristics Related to Their Dynamic Behavior Forecast. Proc. of the 2001 IEEE Conference on Evolutionary Computation, to be held in Seoul, South Korea. To appear.

    Google Scholar 

  17. Packard, N. (1988). Adaptation toward the Edge of Chaos. In: Dynamic Patterns in Complex Systems. Singapore, 293–301.

    Google Scholar 

  18. Sipper, M. (1998). A simple Cellular Automata that solves the density and ordering problems. International Journal of Modern Physics, 9(7).

    Google Scholar 

  19. Wolfram, S. (1994). Cellular Automata and Complexity. U.S.A.: Addison-Wesley.

    MATH  Google Scholar 

  20. Wuensche, A. (1999). Classifying Cellular Automata Automatically: Finding gliders, filtering, and relating space-time patterns, attractor basins and the Z parameter. Complexity, 4(3):47–66.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidade Presbiteriana Mackenzie, R. da Consolação 896, 6° Andar, Consolação, 01302-907, São Paulo, SP, Brazil

    Gina M. B. Oliveira & Pedro P. B. de Oliveira

  2. Instituto Tecnológico de Aeronáutica, Praça Marechal E. Gomes 50, Vila das Acácias, 12228-901, São José dos Campos, SP, Brazil

    N. Omar

Authors
  1. Gina M. B. Oliveira
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pedro P. B. de Oliveira
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. Omar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Philosophy and Science Institute of Computer Science, Silesian University, 74601, Opava, Czech Republic

    Jozef Kelemen  & Petr Sosík  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Oliveira, G.M.B., de Oliveira, P.P.B., Omar, N. (2001). Searching for One-Dimensional Cellular Automata in the Absence of a priori Information. In: Kelemen, J., Sosík, P. (eds) Advances in Artificial Life. ECAL 2001. Lecture Notes in Computer Science(), vol 2159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44811-X_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-44811-X_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42567-0

  • Online ISBN: 978-3-540-44811-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation