Power spectral analysis of the computation process by rule 110

Shigeru Ninagawa; Genaro J. Martínez

doi:10.1007/978-3-319-11520-7_6

Power spectral analysis of the computation process by rule 110

Shigeru Ninagawa, Genaro J. Martínez

Escuela Superior de Cómputo (ESCOM)

Producción científica: Contribución a una revista › Artículo › revisión exhaustiva

1 Cita (Scopus)

Resumen

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.

Idioma original	Inglés
Páginas (desde-hasta)	45-54
Número de páginas	10
Publicación	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen	8751
DOI	https://doi.org/10.1007/978-3-319-11520-7_6
Estado	Publicada - 2014

Acceder al documento

10.1007/978-3-319-11520-7_6

Otros archivos y enlaces

Enlace a la publicación en Scopus

Citar esto

@article{74965c75a0314b469a646a45bdef8372,

title = "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.",

keywords = "1/f noise, Computational universality, Cyclic tag system, Rule 110",

author = "Shigeru Ninagawa and Mart{\'i}nez, {Genaro J.}",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2014.",

year = "2014",

doi = "10.1007/978-3-319-11520-7_6",

language = "Ingl{\'e}s",

volume = "8751",

pages = "45--54",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

publisher = "Springer Verlag",

}

TY - JOUR

T1 - Power spectral analysis of the computation process by rule 110

AU - Ninagawa, Shigeru

AU - Martínez, Genaro J.

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2014.

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - 1/f noise

KW - Computational universality

KW - Cyclic tag system

KW - Rule 110

UR - http://www.scopus.com/inward/record.url?scp=84911922240&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-11520-7_6

DO - 10.1007/978-3-319-11520-7_6

M3 - Artículo

AN - SCOPUS:84911922240

SN - 0302-9743

VL - 8751

SP - 45

EP - 54

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -

Power spectral analysis of the computation process by rule 110

Resumen

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto