Reversible computing (original) (raw)

1980, Automata, Languages and Programming

The theory of reversible computing is based on invertib|e primitives and composition rules that preserve invertibility. With these constraints, one can still satisfactorily deal with both functional and structural aspects of computing processes; at the same time, one attains a closer correspondence between the behavior of abstract computing systems and the microscopic physical laws (which are presumed to be strictly reversible) that underly any concrete implementation of such systems. According to a physical interpretation, the central result of this paper is that i¢ is ideally possible to build sequential c/rcuits with zero internal power dissipation. L Introduction This is an abridged version of a much longer report of the same title[27], to which the reader may turn for further details, most proofs, and extended references. Here, the numbering of formulas, figures, etc. reflects that of the original version.