𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reversible simulation of space-bounded computations

✍ Scribed by Pierluigi Crescenzi; Christos H. Papadimitriou

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
359 KB
Volume
143
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Halting space-bounded computations
Halting space-bounded computations
✍ Michael Sipser πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 378 KB
Reversible space–time simulation of cell
Reversible space–time simulation of cellular automata
✍ JΓ©rΓ΄me O. Durand-Lose πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 276 KB

The goal of this paper is to design a reversible d-dimensional cellular automaton which is capable of simulating the behavior of any given d-dimensional cellular automaton over any given conΓΏguration (even inΓΏnite) with respect to a well suited notion of simulation we introduce. We generalize a prob

Reversible simulation of irreversible co
Reversible simulation of irreversible computation
✍ Ming Li; John Tromp; Paul VitΓ‘nyi πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 688 KB

Computer computations are generally irreversible while the laws of physics are reversible. This mismatch is penalized by among other things generating excess thermic entropy in the computation. Computing performance has improved to the extent that efficiency degrades unless all algorithms are execut

Tape-reversal bounded turing machine com
Tape-reversal bounded turing machine computations
✍ J. Hartmanis πŸ“‚ Article πŸ“… 1968 πŸ› Elsevier Science 🌐 English βš– 667 KB

This paper studies the classification of recursive sets by the number of tape reversals required for their recognition on a two-tape Turing machine with a one-way input tape. This measure yields a rich hierarchy of tape-reversal limited complexity classes and their properties and ordering are inves