On Aperiodic Reversible Turing Machines (invited talk)
Abstract
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.
Origin | Files produced by the author(s) |
---|
Loading...