Given any irreversible program with running time T and space complexity S, and given any
ε>0, Bennett shows how to construct an equivalent reversible program with running time …

We prove a general upper bound on the tradeoff between time and space that suffices for
the reversible simulation of irreversible computation. Previously, only simulations using …

Time, Space, and Energy in Reversible Computing Page 1 Time, Space, and Energy in
Reversible Computing Paul Vitányi ∗ CWI University of Amsterdam National ICT of Australia …

Few books comprehensively cover the software and programming aspects of reversible
computing. Filling this gap, Introduction to Reversible Computing offers an expanded view of …

Intuitively, the minimal information distance between z and g is the length of the shortest
program for a universal computer to transform z into v and y into z. This measure will be …

Abstract Information loss from a computation implies energy dissipation due to Landauer's
Principle. Thus, increasing the amount of useful computational work that can be …

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 …

We initiate the systematic study of the energy complexity of algorithms (in addition to time
and space complexity) based on Landauer's Principle in physics, which gives a lower bound …

Today's computers are based on irreversible logic devices, which have been known to be
fundamentally energy-inefficient for several decades. Recently, alternative reversible logic …

A reversible programming language supports deterministic forward and backward
computation. This tutorial focuses on a high-level reversible programming language Janus …