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 …

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 …

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 …

Reversible computation allows computation to proceed not only in the standard, forward
direction, but also backward, recovering past states. While reversible computation has …

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 …

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 …

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

The reversible computation paradigm aims to provide a new foundation for general classical
digital computing that is capable of circumventing the thermodynamic limits to the energy …

Reversible computing is motivated by the von Neumann-Landauer (VNL) principle, a
theorem of modern physics telling us that ordinary irreversible logic operations (which …

There is one, and only one way, consistent with fundamental physics, that the efficiency of
general digital computation can continue increasing indefinitely, and that is to apply the …