Computation and universality: Class IV versusClass III cellular automata
Seck Tuoh Mora, Juan Carlos
2012
Martínez, G. J., Seck-Tuoh-Mora, J.C. & Zenil, H. (2012). Computation and universality: Class IV versus Class III cellular automata. Journal of Cellular Automata, 7, 393-430.
Abstract
This paper examines the claim that cellular automata (CA) belonging to Class III (in Wolfram's classification) are capable of (Turing universal)computation.We explore some chaotic CA (believed to belong to Class III) reported over the course of the CA history, that may be candidates for universal computation, hence spurring the discussion on Turing universality on both Wolfram's classes III and IV.
Artículos relacionados
Reproducing the Cyclic Tag System Developed by Matthew Cook with Rule 110 Using the Phases f(i-)1.
Elementary cellular automaton Rule 110 explained as a block substitution system
How to Make Dull Cellular Automata Complex by Adding Memory: Rule 126 Case Study
Modeling a Nonlinear Liquid Level System by Cellular Neural Networks
Complex Dynamics Emerging in Rule 30 with Majority Memory
Unconventional invertible behaviors in reversible one-dimensional cellular automata.
Pair Diagram and Cyclic Properties Characterizing the Inverse of Reversible Automata