On reversible turing machines and their function universality
We provide a treatment of the reversible Turing machines (RTMs) under a strict function
semantics. Unlike many existing reversible computation models, we distinguish strictly …
semantics. Unlike many existing reversible computation models, we distinguish strictly …
A simple and efficient universal reversible Turing machine
We construct a universal reversible Turing machine (URTM) from first principles. We take a
strict approach to the semantics of reversible Turing machines (RTMs), under which they can …
strict approach to the semantics of reversible Turing machines (RTMs), under which they can …
Time-symmetric Turing machines for computable involutions
K Nakano - Science of Computer Programming, 2022 - Elsevier
A reversible Turing machine is a forward and backward deterministic Turing machine, which
has been an expressive model of reversible computation. It is obvious that every reversible …
has been an expressive model of reversible computation. It is obvious that every reversible …
Time/space trade-offs for reversible computation
CH Bennett - SIAM Journal on Computing, 1989 - SIAM
A reversible Turing machine is one whose transition function is 1:1, so that no instantaneous
description (ID) has more than one predecessor. Using a pebbling argument, this paper …
description (ID) has more than one predecessor. Using a pebbling argument, this paper …
On a class of reversible primitive recursive functions and its turing-complete extensions
Reversible computing is both forward and backward deterministic. This means that a
uniquely determined step exists from the previous computational configuration (backward …
uniquely determined step exists from the previous computational configuration (backward …
What do reversible programs compute?
Reversible computing is the study of computation models that exhibit both forward and
backward determinism. Understanding the fundamental properties of such models is not …
backward determinism. Understanding the fundamental properties of such models is not …
Involutory turing machines
K Nakano - International Conference on Reversible Computation, 2020 - Springer
An involutory function, also called involution, is a function f that is its own inverse, ie, f (f (x))=
x holds whenever f (x) is defined. This paper presents a computational model of involution …
x holds whenever f (x) is defined. This paper presents a computational model of involution …
Time complexity of tape reduction for reversible Turing machines
HB Axelsen - International Workshop on Reversible Computation, 2011 - Springer
Studies of reversible Turing machines (RTMs) often differ in their use of static resources
such as the number of tapes, symbols and internal states. However, the interplay between …
such as the number of tapes, symbols and internal states. However, the interplay between …
Isomorphic interpreters from logically reversible abstract machines
In our previous work, we developed a reversible programming language and established
that every computation in it is a (partial) isomorphism that is reversible and that preserves …
that every computation in it is a (partial) isomorphism that is reversible and that preserves …
A hierarchy of fast reversible turing machines
Reversible Turing machines with a working tape and a one-way or two-way read-only input
tape are considered. We investigate the classes of languages acceptable by such devices …
tape are considered. We investigate the classes of languages acceptable by such devices …