Complexity Analysis in Cyclic Tag System Emulated by Rule 110
Abstract
It is known that elementary cellular automaton rule 110 is capable of supporting universal computation by emulating cyclic tag system. Since the whole information necessary to perform computation is stored in the configuration, it is reasonable to investigate the complexity of configuration for the analysis of computing process. In this research we employed Lempel-Ziv complexity as a measure of complexity and calculated it during the evolution of emulating cyclic tag system by rule 110. As a result, we observed the stepwise decline of complexity during the evolution. That is caused by the transformation from table data to moving data and the elimination of table data by a rejector.
Cite
@article{arxiv.1307.7951,
title = {Complexity Analysis in Cyclic Tag System Emulated by Rule 110},
author = {Shigeru Ninagawa and Genaro J. Martínez},
journal= {arXiv preprint arXiv:1307.7951},
year = {2013}
}
Comments
AUTOMATA 2013: 19th International Workshop on Cellular Automata and Discrete Complex Systems, Universit\"at Giessen, Germany, September 17-19, 2013