1. Repositorio Digital IPN
  2. Posgrado
  3. SEPI Escuela Superior de Computo
  4. Investigación
  5. Libros
Por favor, use este identificador para citar o enlazar este ítem: http://repositoriodigital.ipn.mx/handle/123456789/12492
Título : Irreducibility and Computational Equivalence
Autor : Zenil, Hector
Palabras clave : Cellular Automata, universality, unconventional computing, complexity, gliders, attractors. mean field theory, information theory, compressibility
Fecha de publicación : 2005
Editorial : Springer
Resumen : We 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.
Descripción : We 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.
URI : http://www.repositoriodigital.ipn.mx/handle/123456789/12492
ISSN : 2194-7278
Aparece en las colecciones: Libros

Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
escanear0016.pdfIrreducibility and Computational Equivalence3.45 MBAdobe PDFVisualizar/Abrir
Mostrar el registro Dublin Core completo del ítem


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