Reversible simulation of irreversible computation
PhysComp96 Proceedings of the fourth workshop on Physics and computation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
A Simple Universal Logic Element and Cellular Automata for Reversible Computing
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Techniques for the synthesis of reversible Toffoli networks
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Reversible computing and cellular automata—A survey
Theoretical Computer Science
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Logical reversibility of computation
IBM Journal of Research and Development
Efficient turing-universal computation with DNA polymers
DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
Fluctuation-driven computing on number-conserving cellular automata
Information Sciences: an International Journal
An Algorithm for Synthesis of Reversible Logic Circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 5.23 |
This paper proposes a novel scheme for constructing reversible Turing machines (RTMs) via various reversible logic elements. A reversible logic element is similar to a conventional reversible logic gate, except that the element also carries a 1-bit memory that can store binary states. The usage of internal states allows much more efficient and straightforward constructions of RTMs based on reversible elements than based on reversible logic gates. In particular, a remarkable feature of our constructions is that they can operate asynchronously, whereby the clock signal, which is indispensable for synchronizing all elements as in a reversible logic circuit, can possibly be removed from the construction.