Reversible computing

  • Tommaso Toffoli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 85)


The theory of reversible computing is based on invertible 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 it is ideally possible to build sequential circuits with zero internal power dissipation.


Cellular Automaton Turing Machine Finite Automaton Composition Rule Causality Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

List of references

  1. [4]
    Bennett, C.H., "Logical Reversibility of Computation," IBM J. Res. Dev.6 (1973), 525–532.Google Scholar
  2. [7]
    Fredkin, Edward, andToffoli, Tommaso, "Conservative Logic," (in preparation). Some of the material of this paper is tentatively available in the form of unpublished notes from Prof. Fredkin's lectures, collected and organized by Bill Silver in a 6.895 Term Paper, "Conservative Logic," and in the form of another 6.895 Term Paper, "A Reversible Computer Using Conservative Logic," by Edward Barton, both at the MIT Dept. of Electr. Eng. Comp. Sci. (1978).Google Scholar
  3. [11]
    Kinoshita, Kozo, et al., "On Magnetic Bubble Circuits," IEEE Trans. ComputersC-25 (1976), 247–253.Google Scholar
  4. [12]
    Landauer, Rolf, "Irreversibility and Heat Generation in the Computing Process," IBM J.5 (1961), 183–191.Google Scholar
  5. [20]
    Toffoli, Tommaso, "computation and Construction Universality of Reversible Cellular Automata," J. Comput. Syst. Sci.15 (1977), 213–231.Google Scholar
  6. [21]
    Toffoli, Tommaso, "Cellular Automata Mechanics" (Ph. D. Thesis), Tech. Rep. no. 208, Logic of Computers Group, Univ. of Michigan (1977).Google Scholar
  7. [22]
    Toffoli, Tommaso, "The Role of the Observer in Uniform Systems," Applied General Systems Research (ed. G. J. Klir), 395–400 (Plenum Press, 1978).Google Scholar
  8. [23]
    Toffoli, Tommaso, "Bicontinuous Extensions of Invertible Combinatorial Functions," Tech. Memo MIT/LCS/TM-124, MIT Lab. for Comp. Sci. (1979) (to appear in Math. Syst. Theory).Google Scholar
  9. [27]
    Toffoli, Tommaso, "Reversible Computing," Tech. Memo MIT/LCS/TM-151, MIT Lab. for Comp. Sci. (1980).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Tommaso Toffoli
    • 1
  1. 1.MIT Laboratory for Computer ScienceCambridge

Personalised recommendations