Tag Systems and the Complexity of Simple Programs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Tag Systems and the Complexity of Simple Programs

Résumé

In this mini-survey we discuss time complexity and program size results for universal Turing machines, tag systems, cellular automata, and other simple models of computation. We discuss results that show that many of the simplest known models of computation including the smallest known universal Turing machines and the elementary cellular automaton Rule 110 are efficient simulators of Turing machines. We also recall a recent result where the halting problem for tag systems with only 2 symbols (the minimum possible) is proved undecidable. This result has already yielded applications including a significant improvement on previous undecidability bounds for the Post correspondence problem and the matrix mortality problem.
Fichier principal
Vignette du fichier
338243_1_En_2_Chapter.pdf (109.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01442479 , version 1 (20-01-2017)

Licence

Paternité

Identifiants

Citer

Turlough Neary, Damien Woods. Tag Systems and the Complexity of Simple Programs. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. pp.11-16, ⟨10.1007/978-3-662-47221-7_2⟩. ⟨hal-01442479⟩
66 Consultations
453 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More