Conservative logic

@article{Fredkin1982ConservativeL,
  title={Conservative logic},
  author={Edward Fredkin and Tommaso Toffoli},
  journal={International Journal of Theoretical Physics},
  year={1982},
  volume={21},
  pages={219-253}
}
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… Expand
Embracing the Laws of Physics: Three Reversible Models of Computation
TLDR
The aim is to re-develop foundational computational models that embraces the principle of conservation of information, and defines what Conservation of information means in a computational setting, and emphasizes that computations must be reversible transformations on data. Expand
Universal Families of Reversible P Systems
TLDR
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. Expand
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 toExpand
Reversible computation is a great metaphor for the foundations of physics
, Vol. 4, No. 1 8 1 25-05 INTRODUCTION A reversible computation is a computation that can be reversed completely. That is, after insertion of an arbitrary input into a reversible computer, theExpand
Design of Reversible Computing Systems Logic , Languages , and Circuits
Reversible computing spans computational models that are both forward and backward deterministic. These models have applications in program inversion and bidirectional computing, and are alsoExpand
One-to-one General Discussion
Reversible computation is a great metaphor for the foundations of physics. General discussion A reversible computation is a computation which can be reversed completely. That is, after insertion ofExpand
The physics of implementing logic: Landauer's principle and the multiple-computations theorem
  • M. Hemmo, Orly Shenker
  • Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics
  • 2019
Abstract This paper makes a novel linkage between the multiple-computations theorem in philosophy of mind and Landauer's principle in physics. The multiple-computations theorem implies that certainExpand
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.Expand
C C L
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 theExpand
Universal Gates in Other Universes
TLDR
A new formalization for computation which is similar to traditional circuit models but which depends upon the choice of a family of [semi]groups, which yields classical but probabilistic computation, and point to many new avenues of investigation permitted by this model. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 37 REFERENCES
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. ItExpand
Logical reversibility of computation
TLDR
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. Expand
ON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION
TLDR
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. Expand
Reversible Computing
TLDR
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. Expand
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 HamiltonianHNQExpand
On Magnetic Bubble Logic Circuits
TLDR
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. Expand
Wanted: a physically possible theory of physics
TLDR
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. Expand
Universal upper bound on the entropy-to-energy ratio for bounded systems
We present evidence for the existence of a universal upper bound of magnitude $\frac{2\ensuremath{\pi}R}{\ensuremath{\hbar}c}$ to the entropy-to-energy ratio $\frac{S}{E}$ of an arbitrary system ofExpand
On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
In a paper entitled "On computable numbers, with an application to the Entscheidungsproblem"* the author gave a proof of the insolubility of the Entscheidungsproblem of the "engere Funktionenkalkul".Expand
On Computable Numbers, with an Application to the Entscheidungsproblem
1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable sequences and numbers. 3. Examples of computing machines. 4. AbbreviatedExpand
...
1
2
3
4
...