Skip to main content

Evolution of One-Dimensional Cellular Automata by 1/f Noise

  • Conference paper
Advances in Artificial Life (ECAL 2007)

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

Included in the following conference series:

Abstract

It is speculated that there is a relationship between 1/f noise and computational universality in cellular automata. We use genetic algorithms to search for one-dimensional and two-state, five-neighbor cellular automata which have 1/f-type spectrum. A power spectrum is calculated from the evolution starting from a random initial configuration. The fitness is estimated from the power spectrum in consideration of the similarity to 1/f-type spectrum. The result shows that the rule with the highest average fitness has a propagating structure like other computationally universal cellular automata, although computational universality of the rule has not been proved yet.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Crutchfield, J., Farmer, D., Packard, N., Shaw, R., Jones, G., Donnelly, R.J.: Power spectral snalysis of a synamical system. Phys. Lett. 76A, 1–4 (1980)

    MathSciNet  Google Scholar 

  2. von Neumann, J.: Theory of Self-reproducing Automata. University of Illinois Press, Illinois (1966)

    Google Scholar 

  3. Codd, E.F.: Cellular Automata. Academic Press, New York (1968)

    MATH  Google Scholar 

  4. Banks, E.R.: Information processing and transmission in cellular automata, thesis, Massachusetts Institute of Technology (1971)

    Google Scholar 

  5. Serizawa, T.: Universal cellular automata with minimal states and neighbors (1), Paper of Technical Group AL77-26, 1–10 (in Japanese) (1977)

    Google Scholar 

  6. Serizawa, T.: Universal cellular automata with minimal states and neighbors (2), Paper of Technical Group AL77-27, 11–18 (in Japanese) (1977)

    Google Scholar 

  7. Smith III., A.R.: Simple computation-universal cellular spaces. J. ACM 18, 339–353 (1971)

    Article  MATH  Google Scholar 

  8. Albert, J., Culik II., K.: A simple universal cellular automaton and its one-way and totalistic version. Complex Systems 1, 1–16 (1987)

    MATH  MathSciNet  Google Scholar 

  9. Lindgren, K., Nordahl, M.G.: Universal computation in simple one-dimensional cellular automata. Complex Systems 4, 299–318 (1990)

    MATH  MathSciNet  Google Scholar 

  10. Cook, M.: Universality in elementary cellular automata. Complex Systems 15, 1–40 (2004)

    MathSciNet  Google Scholar 

  11. Ninagawa, S.: 1/f Noise in elementary cellular automaton rule 110. In: Calude, C.S., Dinneen, M.J., Păun, G., Rozenberg, G., Stepney, S. (eds.) UC 2006. LNCS, vol. 4135, pp. 207–216. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for Your Mathematical Plays, vol. 2. Academic Press, New York (1982)

    Google Scholar 

  13. Ninagawa, S., Yoneda, M., Hirose, S.: 1/f fluctuation in the ”Game of Life. Physica D 118, 49–52 (1988)

    Article  Google Scholar 

  14. 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)

    MATH  Google Scholar 

  15. Mitchell, M., Crutchfield, J.P., Hraber, P.T.: Evolving cellular automata to perform computations: mechanisms and impediments. Physica D 75, 361–391 (1994)

    Article  MATH  Google Scholar 

  16. Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55, 601–644 (1983)

    Article  MathSciNet  Google Scholar 

  17. Wolfram, S. (ed.): Theory and Applications of Cellular Automata. World Scientific, Singapore (1986)

    MATH  Google Scholar 

  18. Li, W., Packard, N.: The structure of the elementary cellular automata rule space. Complex Systems 4, 281–297 (1990)

    MathSciNet  Google Scholar 

  19. Wolfram, S.: A New Kind of Science. Wolfram Media, Champaign (2002)

    MATH  Google Scholar 

  20. Keshner, M.S.: 1/f noise. Proc. IEEE 70, 211–218 (1982)

    Article  Google Scholar 

  21. Langton, C.G.: Studying artificial life with cellular automata. Physica D 22, 120–149 (1986)

    Article  MathSciNet  Google Scholar 

  22. Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical recipes in C, 2nd edn. Cambridge University Press, Cambridge (1992)

    MATH  Google Scholar 

  23. Pomeau, Y., Manneville, P.: Intermittent transition to turbulence in dissipative dynamical systems. Commun. Math. Phys. 74, 189–197 (1980)

    Article  MathSciNet  Google Scholar 

  24. Langton, C.G.: Computation at the edge of chaos: phase transitions and emergent computation. Physica D 42, 12–37 (1990)

    Article  MathSciNet  Google Scholar 

  25. Li, W., Packard, N.H., Langton, C.G.: Transition phenomena in cellular automata rule space. Physica D 45, 77–94 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Fernando Almeida e Costa Luis Mateus Rocha Ernesto Costa Inman Harvey António Coutinho

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ninagawa, S. (2007). Evolution of One-Dimensional Cellular Automata by 1/f Noise. In: Almeida e Costa, F., Rocha, L.M., Costa, E., Harvey, I., Coutinho, A. (eds) Advances in Artificial Life. ECAL 2007. Lecture Notes in Computer Science(), vol 4648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74913-4_91

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74913-4_91

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74912-7

  • Online ISBN: 978-3-540-74913-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics