Por favor, use este identificador para citar o enlazar este ítem: http://repositoriodigital.ipn.mx/handle/123456789/12492
Registro completo de metadatos
Campo DC Valor Lengua/Idioma
dc.contributor.authorZenil, Hector-
dc.date.accessioned2013-02-06T14:04:27Z-
dc.date.available2013-02-06T14:04:27Z-
dc.date.issued2005-
dc.identifier.issn2194-7278-
dc.identifier.urihttp://www.repositoriodigital.ipn.mx/handle/123456789/12492-
dc.descriptionWe conduct a brief survey on Wolfram's classification, in particular 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.es
dc.description.abstractWe conduct a brief survey on Wolfram's classification, in particular 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.es
dc.language.isoen_USes
dc.publisherSpringeres
dc.subjectCellular Automata, universality, unconventional computing, complexity, gliders, attractors. mean field theory, information theory, compressibilityes
dc.titleIrreducibility and Computational Equivalencees
dc.typeBookes
dc.description.especialidadComputaciones
dc.description.tipoPDFes
Aparece en las colecciones: Libros

Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
escanear0016.pdfIrreducibility and Computational Equivalence3.45 MBAdobe PDFVisualizar/Abrir


Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.