Skip to main content

Power Spectral Analysis of the Computation Process by Rule 110

  • Conference paper
  • 3029 Accesses

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

Abstract

An elementary cellular automaton rule 110 supports universal computation by emulating cyclic tag system and its evolution starting from random initial configurations exhibits 1/f noise. In this research we investigate the power spectra of rule 110 during the computation process emulating cyclic tag system. As a result, 1/f-type power spectra are observed in the most actively interacting area among the whole array, while in the less active area the power spectra exhibit Lorentzian or periodic types. These results suggest the relationship between 1/f noise and computability in cellular automata.

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

Buying options

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. Cook, M.: Universality in elementary cellular automata. Complex Systems 15, 1–40 (2004)

    MATH  MathSciNet  Google Scholar 

  2. Ninagawa, S.: Power spectral analysis of elementary cellular automata. Complex Systems 17, 399–411 (2008)

    MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  Google Scholar 

  6. Martínez, G.J., McIntosh, H.V., Seck-Tuoh-Mora, J.C., Vergara, S.V.C.: Reproducing the cyclic tag system developed by Mattew Cook with rule 110 using the phase f i _1. J. Cellular Automata 6, 121–161 (2011)

    MATH  Google Scholar 

  7. Martínez, G.J.: Elementary cellular automaton rule 110, http://uncomp.uwe.ac.uk/genaro/rule110/ctsRule110.html

  8. Ninagawa, S., Martínez, G.J.: Compression-based analysis of cyclic tag system emulated by rule 110. J. Cellular Automata 9, 23–35 (2014)

    MATH  Google Scholar 

  9. Manneville, P.: Intermittency, self-similarity and 1/f spectrum in dissipative dynamical systems. J. Physique 41, 1235–1243 (1980)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Ninagawa, S., Martínez, G.J. (2014). Power Spectral Analysis of the Computation Process by Rule 110. In: Wąs, J., Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2014. Lecture Notes in Computer Science, vol 8751. Springer, Cham. https://doi.org/10.1007/978-3-319-11520-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11520-7_6

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11519-1

  • Online ISBN: 978-3-319-11520-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics