Tag Systems and the Complexity of Simple Programs

Abstract : 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.
Type de document :
Communication dans un congrès
Jarkko Kari. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. Springer, Lecture Notes in Computer Science, LNCS-9099, pp.11-16, 2015, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-662-47221-7_2〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01442479
Contributeur : Hal Ifip <>
Soumis le : vendredi 20 janvier 2017 - 16:09:33
Dernière modification le : lundi 23 janvier 2017 - 14:07:24
Document(s) archivé(s) le : vendredi 21 avril 2017 - 16:05:45

Fichier

338243_1_En_2_Chapter.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Turlough Neary, Damien Woods. Tag Systems and the Complexity of Simple Programs. Jarkko Kari. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. Springer, Lecture Notes in Computer Science, LNCS-9099, pp.11-16, 2015, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-662-47221-7_2〉. 〈hal-01442479〉

Partager

Métriques

Consultations de la notice

36

Téléchargements de fichiers

2