Conservative logic

  title={Conservative logic},
  author={Edward Fredkin and Tommaso Toffoli},
  journal={International Journal of Theoretical Physics},
Conservative logic is a comprehensive model of computation which explicitly reflects a number of fundamental principles of physics, such as the reversibility of the dynamical laws and the conservation of certainadditive quantities (among which energy plays a distinguished role). Because it more closely mirrors physics than traditional models of computation, conservative logic is in a better position to provide indications concerning the realization of high-performance computing systems, i.e… 
Embracing the Laws of Physics: Three Reversible Models of Computation
Universal Families of Reversible P Systems
This paper introduces energy–based P systems as a parallel and distributed model of computation in which the amount of energy manipulated and/or consumed during computations is taken into account and shows how energy– based P systems can be used to simulate reversible Fredkin circuits.
Quantum Computation a
When we describe the operation of a computer, we are of course describing the dynamical evolution of physical system. What distinguishes a computer from other physical systems is its ability to
Design of Reversible Computing Systems Logic , Languages , and Circuits
This thesis has shown that it is possible to design non-trivial reversible computing systems without garbage and that support from languages (computer aided design) can make this process easier.
Reversible computation is a great metaphor for the foundations of physics
A reversible computation is a computation that can be reversed completely, and in the strict sense of reversibility discussed here, one-tomany operations, such as copying, are forbidden as well.
One-to-one General Discussion
A reversible computation is a computation which can be reversed completely, that is, after insertion of the input into a reversible computer, the reversible computer generates some output (if ever).
The physics of implementing logic: Landauer's principle and the multiple-computations theorem
  • M. Hemmo, O. Shenker
  • Physics
    Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics
  • 2019
Fundamental Physics and Computation: The Computer-Theoretic Framework
The central goal of this manuscript is to survey the relationships between fundamental physics and computer science. We begin by providing a short historical review of how different concepts of
Physics, Topology, Logic and Computation: A Rosetta Stone
In physics, Feynman diagrams are used to reason about quantum processes. In the 1980s, it became clear that underlying these diagrams is a powerful analogy between quantum physics and topology.
Conservation laws in physics are numerical invariants of the dynamics of a system. This article concerns conservation laws in a fictitious universe of a cellular automaton. We give an overview of the


Fundamental Limitations in the Computational Process
Information in computers, in biological systems, or in any other form, inevitably requires the use of physical degrees of freedom. Information is not a purely mathematical or philosophical entity. It
Logical reversibility of computation
This result makes plausible the existence of thermodynamically reversible computers which could perform useful computations at useful speed while dissipating considerably less than kT of energy per logical step.
It can be shown that even in a world governed by this system M nontrivial self-reproduction can be established, thus illuminating what simple combinatorial structures allow for the handling of such logical somewhat difficult phenomenas as self-organization, self- reproduction, etc.
Reversible Computing
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.
The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
In this paper a microscopic quantum mechanical model of computers as represented by Turing machines is constructed. It is shown that for each numberN and Turing machineQ there exists a HamiltonianHNQ
On Magnetic Bubble Logic Circuits
It is shown that the minimum circuits of most functions have the characteristic circuit structure called ``1-4 form'' in the last half of this paper.
These lectures comprise an introductory course in statistical mechanics. The Gibbs formulation of the canonical ensemble is introduced and illustrated by application to simple models of magnets and
Irreversibility and heat generation in the computing process
Two simple, but representative, models of bistable devices are subjected to a more detailed analysis of switching kinetics to yield the relationship between speed and energy dissipation, and to estimate the effects of errors induced by thermal fluctuations.
Wanted: a physically possible theory of physics
The ability to predict the nature of physics in great detail depends upon the ultimate capabilities of information processing systems, and an intertwining between the ultimate versions of the laws of physics and the computer is created.
On computable numbers, with an application to the Entscheidungsproblem
  • A. Turing
  • Computer Science
    Proc. London Math. Soc.
  • 1937
This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.