Cellular Automata are Generic
Logic in Computer Science
2015-04-14 v1
Abstract
Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular automaton with unconstrained topology and with the power to create new cells. The advantage is that the latter is closer to physical reality. The overhead of our simulation is quadratic.
Cite
@article{arxiv.1504.03013,
title = {Cellular Automata are Generic},
author = {Nachum Dershowitz and Evgenia Falkovich},
journal= {arXiv preprint arXiv:1504.03013},
year = {2015}
}
Comments
In Proceedings DCM 2014, arXiv:1504.01927