Wolfram's Classification and Computation in Cellular Automata Classes III and IV
Abstract
We conduct a brief survey on Wolfram's classification, in particular related to the computing capabilities of Cellular Automata (CA) in Wolfram's classes III and IV. We formulate and shed light on the question of whether Class III systems are capable of Turing universality or may turn out to be "too hot" in practice to be controlled and programmed. We show that systems in Class III are indeed capable of computation and that there is no reason to believe that they are unable, in principle, to reach Turing-completness.
Keywords
Cite
@article{arxiv.1208.2456,
title = {Wolfram's Classification and Computation in Cellular Automata Classes III and IV},
author = {Genaro J. Martinez and J. C. Seck-Tuoh-Mora and Hector Zenil},
journal= {arXiv preprint arXiv:1208.2456},
year = {2012}
}
Comments
27 pages, 13 figures, forthcoming in Irreducibility and Computational Equivalence to be published by Springer Verlag (http://www.mathrix.org/ANKSAnniversaryVolume.html). Extended paper version to appear in the Journal of Cellular Automata (JCA)