Power spectral analysis of the computation process by rule 110

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.