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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Ninagawa, S. (2006). 1/f noise in elementary cellular automaton rule 110. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4135 LNCS, pp. 207–216). Springer Verlag. https://doi.org/10.1007/11839132_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
