Time and space bounds for reversible simulation (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2076 LNCS, Issue , 2001, Pages 1017-1027

  Buhrman, Harry ^a   Tromp, John ^a   Vitányi, Paul ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; COMPUTATIONAL LINGUISTICS;

BOUNDARY VALUES; EXPONENTIAL TIME; EXTENDED ABSTRACTS; GENERAL UPPER BOUND; IRREVERSIBLE COMPUTATION; REVERSIBLE SIMULATIONS; STORAGE SPACES; SUBEXPONENTIAL TIME; SPACE BOUNDS;

AUTOMATA THEORY;

EID: 84879517305     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_82     Document Type: Conference Paper

References (17)

1. C. H. Bennett. Logical reversibility of computation. IBM J. Res. Develop. , 17:525-532, 1973.
2. C. H. Bennett. The thermodynamics of computation-a review. Int. J. Theoret. Phys. , 21(1982), 905-940.
3. C. H. Bennett. Time-space tradeoffs for reversible computation. SIAM J. Comput. , 18(1989), 766-776.
4. E. Fredkin and T. Toffoli. Conservative logic. Int. J. Theoret. Phys. , 21(1982),219-253.
5. M. Frank, T. Knight, and N. Margolus, Reversibility in optimally scalable computer architectures, Manuscript, MIT-LCS, 1997//http://www. ai. mit. edu/mpf/publications. html.
6. M. P. Frank and M. J. Ammer, Separations of reversible and irreversible space-time complexity classes, Submitted.//http://www. ai. mit. edu/mpf/rc/memos/M06 oracle. html.
7. R. W. Keyes, IBM J. Res. Dev. , 32(1988), 24-28.
8. R. Landauer. Irreversibility and heat generation in the computing process. IBM J. Res. Develop. , 5:183-191, 1961.
9. K. J. Lange, P. McKenzie, and A. Tapp, Reversible space equals deterministic space, J. Comput. System Sci. , 60:2(2000), 354-367.
10. R. Y. Levine and A. T. Sherman, A note on Bennett's time-space tradeoff for reversible computation, SIAM J. Comput. , 19:4(1990), 673-677.
11. M. Li and P. M. B. Vit́anyi, Reversibility and adiabatic computation: trading time and space for energy, Proc. Royal Society of London, Series A, 452(1996), 769-789.
12. M. Li, J. Tromp, and P. Vit́anyi, Reversible simulation of irreversible computation. Physica D, 120(1998) 168-176.
13. K. Morita, A. Shirasaki, and Y. Gono, A 1-tape 2-symbol reversible Turing machine, IEEE Trans. IEICE, E72 (1989), 223-228.
14. M. Nielsen, I. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000.
15. P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. , 26:5(1997), 1484-1509.
16. M. Sipser, Halting space-bounded computation, Theoret. Comp. Sci. , 10(1990), 335-338.
17. R. Williams, Space-Efficient Reversible Simulations, DIMACS REU report, July 2000. http://dimacs. rutgers. edu/ryanw/