Skip to main content
SpringerLink
Log in
Book cover

International Conference on Unconventional Computation

UC 2006: Unconventional Computation pp 207–216Cite as

1/f Noise in Elementary Cellular Automaton Rule 110

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4135))

Abstract

Cellular Automata are considered to be discrete dynamical systems as well as computing systems. Spectral analysis has been employed to investigate the behavior of dynamical systems. We calculated the power spectra from the evolutions starting from a random initial configuration to analyze the temporal behavior in elementary cellular automata. As a result, rule 110 has 1/f spectrum for the longest time steps. Rule 110 alone has proved to be capable of supporting universal computation in elementary cellular automata. These results suggest that there is a relationship between computational universality and 1/f noise in cellular automata.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wolfram, S.: Statistical Mechanics of Cellular Automata. Reviews of Modern Physics 55, 601–644 (1983)

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  3. Martínez, G.J., McIntosh, H.V., Mora, J.C.S.T.: Gliders in Rule 110. Int. Journ. of Unconventional Computing 2, 1–49 (2005)

    Google Scholar 

  4. Li, W.: Power Spectra of Regular Languages and Cellular Automata. Complex Systems 1, 107–130 (1987)

    MathSciNet  MATH  Google Scholar 

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

    MathSciNet  Google Scholar 

  6. Wolfram, S.: Universality and Complexity in Cellular Automata. Physica D 10, 1–35 (1984)

    Article  MathSciNet  Google Scholar 

  7. Crutchfield, J., Farmer, D., Packard, N., Shaw, R., Jones, G., Donnelly, R.J.: Power Spectral Analysis of a Dynamical System. Phys. Lett. 76A, 1–4 (1980)

    MathSciNet  Google Scholar 

  8. Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes in C++, ch. 13, 2nd edn. Cambridge University Press, Cambridge (2002)

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  11. Li, W., Nordahl, M.G.: Transient Behavior of Cellular Automaton Rule 110. Physics Letters A 166, 335–339 (1992)

    Article  Google Scholar 

  12. Cook, M.: Universality in Elementary Cellular Automata. Complex Systems 15, 1–40 (2004)

    MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  16. Li, W., Packard, N.H., Langton, C.G.: Transition Phenomena in Cellular Automata Rule Space. Physica D 45, 77–94 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ninagawa, S.: Evolving Cellular Automata by 1/f Noise. In: Capcarrere, M.S., et al. (eds.) Advances in Artificial Life, pp. 453–460. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Information and Computer Science, Kanazawa Institute of Technology, Ohgigaoka, Nonoichi, Ishikawa, 921-8501, Japan

    Shigeru Ninagawa

Authors
  1. Shigeru Ninagawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Auckland, New Zealand

    Cristian S. Calude

  2. Department of Computer Science, University of Auckland, 92019, Auckland, New Zealand

    Michael J. Dinneen

  3. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, Bucureşti, Romania

    Gheorghe Păun

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  5. Dept. of Computer Science, University of York,  

    Susan Stepney

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ninagawa, S. (2006). 1/f Noise in Elementary Cellular Automaton Rule 110. In: Calude, C.S., Dinneen, M.J., Păun, G., Rozenberg, G., Stepney, S. (eds) Unconventional Computation. UC 2006. Lecture Notes in Computer Science, vol 4135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839132_17

Download citation

  • DOI: https://doi.org/10.1007/11839132_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38593-6

  • Online ISBN: 978-3-540-38594-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation