Reversible space equals deterministic space

Journal of Computer and System Sciences

Volumn 60, Issue 2, 2000, Pages 354-367

  Lange, Klaus Jörn ^a   McKenzie, Pierre ^b   Tapp, Alain ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; GAME THEORY; THEOREM PROVING;

BENNETT'S REVERSIBLE PEBBLE GAME RULES; REVERSIBLE TURING MACHINES; SPACE-BOUNDED DETERMINISTIC TURING MACHINES;

TURING MACHINES;

EID: 0033907711     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1672     Document Type: Article

References (23)

1. E. Allender, and, K.-J. Lange, Symmetry coincides with nondeterminism for time bounded auxiliary pushdown automata, in preparation, 1997.
2. 4/3, in, Proc. of the 29th ACM Symp. on Theory of Computing, 1997.
3. Bennett C. Logical reversibility of computation. IBM J. Res. Develop. 17:1973;525-532.
4. Bennett C. Time/space trade-offs for reversible computation. SIAM J. Comput. 81:1989;766-776.
5. Brassard G. A quantum jump in computer science. van Leeuwen J. Computer Science Today. Lecture Notes in Computer Science. 1000:1995;1-14 Springer-Verlag, Berlin.
6. Cook S. A. A taxonomy of problems with fast parallel algorithms. Inform. and Control. 64:1985;2-22.
7. Cook S. A., McKenzie P. Problems complete for deterministic logarithmic space. J. Algorithms. 8:1987;385-394.
8. Crescenzi P. L., Papadimitrou C. H. Reversible simulation of space-bounded computations. Theoret. Comput. Sci. 143:1995;159-165.
9. Deutsch D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Royal Soc. London, Ser. A. 400:1985;97-117.
10. Feynman R. Feynman Lectures on Computation. 1996;Addison-Wesley, Reading.
11. M. P. Frank, and, M. J. Ammer, Separations of reversible and irreversible space-time complexity classes, manuscript, 1997.
12. Hopcroft J. E., Ullman J. D. Introduction to Automata Theory, Languages, and Computation. 1979;Addison-Wesley, Reading.
13. M. Karchmer and A. Wigderson, On span programs, in Proc. 8th IEEE Structure in Complexity Theory Conference, 1993, pp. 102-111.
14. Landauer R. Irreversibility and heat generation in the computing process. IBM J. Res. Develop. 5:1961;183-191.
15. n, où θ est un "isomorphisme de codes," C. R. Acad. Sci. Paris. 257:1963;2597-2600.
16. Levine R., Sherman A. A note on Bennett's time-space trade-off for reversible computation. SIAM J. Comput. 19:1990;673-677.
17. Lewis P., Papadimitriou C. Symmetric space-bounded computation. Theoret. Comput. Sci. 19:1982;161-187.
18. M. Li and P. Vitanyi, Reversible simulation of irreversible computation, in Proc. 11th IEEE Conference on Computational Complexity, 1996, pp. 301-306.
19. Li M., Vitanyi P. Reversibility and adiabatic computation: trading time and space for energy. Proc. Royal Soc. London, Ser. A. 452:1996;769-789.
20. von Neumann J. Burks A. W. Theory of Self-reproducing Automata. 1966;Univ. Illinois Press, Urbana.
21. N. Nisan, RL⊆SL, in Proc. 24th ACM Symp. on Theory of Computing, 1992, pp. 619-623.
22. P. Shor, Algorithms for quantum computation: Discrete log and factoring, in Proc. 35th IEEE Symp. Foundations of Comput. Sci., 1994, pp. 124-134.
23. Sipser M. Halting space-bounded computations. Theoret. Comput. Sci. 10:1990;335-338.