Computational Aspects of Asynchronous CA
Formal Languages and Automata Theory
2011-05-03 v1 Cellular Automata and Lattice Gases
Abstract
This work studies some aspects of the computational power of fully asynchronous cellular automata (ACA). We deal with some notions of simulation between ACA and Turing Machines. In particular, we characterize the updating sequences specifying which are "universal", i.e., allowing a (specific family of) ACA to simulate any TM on any input. We also consider the computational cost of such simulations.
Cite
@article{arxiv.1105.0065,
title = {Computational Aspects of Asynchronous CA},
author = {Jérôme Chandesris and Alberto Dennunzio and Enrico Formenti and Luca Manzoni},
journal= {arXiv preprint arXiv:1105.0065},
year = {2011}
}