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

dc.contributor.author	Seck Tuoh Mora, Juan Carlos	en_US
dc.date.accessioned	2013-11-04T22:03:42Z
dc.date.available	2013-11-04T22:03:42Z
dc.date.issued	2013	en_US
dc.identifier.citation	Mrtínez, G.J. Seck Tuoh, J.C. Zenil, H.	es
dc.identifier.uri	https://repository.uaeh.edu.mx/bitstream/handle/123456789/8040
dc.description.abstract	We conduct a brief survey on Wolfram?s classification, in particular related to the computing capabilities of Cellular Automata (CA) inWolfram?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.	es
dc.language	es	en_US
dc.subject	Automatización y Optimización de Sistemas Industriales Autómatas Celulares	es
dc.title	Wolfram?s Classification and Computation in Cellular Automata Classes III and IV	es
dc.type	Book chapter	en_US