Computation and Universality: Class IV versus Class III Cellular Automata

dc.creatorSeck Tuoh Mora, Juan Carlos
dc.date.accessioned2013-11-04T22:02:43Z
dc.date.accessioned2022-10-14T15:33:01Z
dc.date.available2013-11-04T22:02:43Z
dc.date.available2022-10-14T15:33:01Z
dc.date.created2013-11-04T22:02:43Z
dc.date.issued2013
dc.identifierMartínez, G.J. Seck Tuoh, J.C.Zenil, H.
dc.identifierhttp://repository.uaeh.edu.mx/bitstream/handle/123456789/8015
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4253534
dc.description.abstractThis 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.
dc.subjectAutomatización y Optimización de Sistemas Industriales Autómatas Celulares
dc.titleComputation and Universality: Class IV versus Class III Cellular Automata
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución