Producción Científica Profesorado

Wolfram's Classification and Computation in Cellular Automata Classes III and IV

Seck Tuoh Mora, Juan Carlos


Martínez, G. J., & Seck-Tuoh-Mora, J. C., & Zenil, H. (2013). Wolfram's Classification and Computation in Cellular Automata Classes III and IV. In Zenil, H. (Ed.), Irreducibility and Computational Equivalence (237-259). Springer Berlin Heidelberg


We conduct a brief survey on Wolfram's classification, inparticular 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-completeness 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 universality.

Producto de Investigación

Artículos relacionados

Reproducing the Cyclic Tag System Developed by Matthew Cook with Rule 110 Using the Phases f(i-)1.

On explicit inversion of a subclass of operators with D-difference kernels and Weyl theory of the co...

Pair Diagram and Cyclic Properties Characterizing the Inverse of Reversible Automata

Modeling a Nonlinear Liquid Level System by Cellular Neural Networks

Elementary cellular automaton Rule 110 explained as a block substitution system

Complex Dynamics Emerging in Rule 30 with Majority Memory

How to Make Dull Cellular Automata Complex by Adding Memory: Rule 126 Case Study

Unconventional invertible behaviors in reversible one-dimensional cellular automata.