On Aperiodic Reversible Turing Machines (invited talk) - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

On Aperiodic Reversible Turing Machines (invited talk)

Résumé

A complete reversible Turing machine bijectively transforms configurations consisting of a state and a bi-infinite tape of symbols into another configuration by updating locally the tape around the head and translating the head on the tape. We discuss a simple machine with 4 states and 3 symbols that has no periodic orbit and how that machine can be embedded into other ones to prove undecidability results on decision problems related to dynamical properties of Turing machines. In this talk, we present a small minimal aperiodic reversible Turing machines and new reduction techniques to study the (un)decidability of dynamical properties of reversible Turing machines. This work is motivated by the study of the computational complexity of dynamical properties of cellular automata, a more classical family of dynamical systems.
Fichier principal
Vignette du fichier
abstract.pdf (207.46 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01984995 , version 1 (17-01-2019)

Identifiants

Citer

Nicolas Ollinger. On Aperiodic Reversible Turing Machines (invited talk). Reversible Computation 10th International Conference (RC 2018), Sep 2018, Leicester, United Kingdom. pp.61-64, ⟨10.1007/978-3-319-99498-7_4⟩. ⟨hal-01984995⟩
36 Consultations
180 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More