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 …

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 …

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 …

We provide a treatment of the reversible Turing machines (RTMs) under a strict function
semantics. Unlike many existing reversible computation models, we distinguish strictly …

Reversible computing is the study of computation models that exhibit both forward and
backward determinism. Understanding the fundamental properties of such models is not …

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 …

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 …

Erasure of information incurs an increase in entropy and dissipates heat. Therefore,
information-preserving computation is essential for constructing computers that use energy …

The reversible Turing machine (ie, r-machine) was introduced initially by CH Bennett [IBM J.
Res. Develop., 6 (1973), pp. 525–532]. In the first part of the paper a convenient …

Many irreversible computation models have reversible counterparts, but these are poorly
understood at present. We introduce reversible flowcharts with an assertion operator and …