Computation and Universality: Class IV versus
Class III Cellular Automata

dc.contributor.author	Seck Tuoh Mora, Juan Carlos	en_US
dc.date.accessioned	2013-11-04T22:02:43Z
dc.date.available	2013-11-04T22:02:43Z
dc.date.issued	2013	en_US
dc.identifier.citation	Martínez, G.J. Seck Tuoh, J.C.Zenil, H.	es
dc.identifier.uri	https://repository.uaeh.edu.mx/bitstream/handle/123456789/8015
dc.description.abstract	This paper examines the claim that cellular automata (CA) belonging toClass III (in Wolfram?s classification) are capable of (Turing universal)computation.We explore some chaotic CA (believed to belong to ClassIII) reported over the course of the CA history, that may be candidatesfor universal computation, hence spurring the discussion on Turing universality on both Wolfram?s classes III and IV.	es
dc.language	es	en_US
dc.subject	Automatización y Optimización de Sistemas Industriales Autómatas Celulares	es
dc.title	Computation and Universality: Class IV versus Class III Cellular Automata	es
dc.type	Article	en_US