Abstract
Elementary (one-dimensional two-state three-neighbor) cellular automaton rule 110 is capable of supporting universal computation and exhibits 1/f noise. However, the power spectra of rule 110 do not always exhibit 1/f-type spectrum because of periodic background particular to rule 110. Since periodic background in rule 110 does not play any role in supporting universal computation, we can expect that the removal of periodic background does not change the behavior essential to supporting universal computation. As a result of removing periodic background, we found that the power spectra fit better to 1/f noise. This result suggests 1/f noise is an intrinsic property of computational universality in cellular automata.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Chaos, Solitons and Fractals: the interdisciplinary journal of Nonlinear Science, and Nonequilibrium and Complex Phenomena
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
