Phase Space Invertible Asynchronous Cellular Automata
Formal Languages and Automata Theory
2012-08-15 v1 Computational Complexity
Discrete Mathematics
Cellular Automata and Lattice Gases
Abstract
While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call phase space invertible asynchronous cellular automata in more detail. We will show that for each Turing machine there is such a cellular automaton simulating it, and that it is decidable whether an asynchronous cellular automaton has this property or not, even in higher dimensions.
Keywords
Cite
@article{arxiv.1208.2765,
title = {Phase Space Invertible Asynchronous Cellular Automata},
author = {Simon Wacker and Thomas Worsch},
journal= {arXiv preprint arXiv:1208.2765},
year = {2012}
}
Comments
In Proceedings AUTOMATA&JAC 2012, arXiv:1208.2498