Time, space, and energy in reversible computing

2005 Computing Frontiers Conference

Volumn , Issue , 2005, Pages 435-444

  Vitányi, Paul ^a,b,c  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b CSIRO   (Australia)

^c CWI   (Netherlands)

Author keywords

Adiabatic computing; Computational complexity; Energy dissipation complexity; Low energy computing; Reversible computing; Reversible simulation; Space complexity; Time complexity; Tradeoffs

Indexed keywords

COMPUTATION THEORY; COMPUTER SIMULATION; TURING MACHINES;

ADIABATIC COMPUTING; ENERGY DISSIPATION COMPLEXITY; LOW-ENERGY COMPUTING; REVERSIBLE COMPUTING; REVERSIBLE SIMULATION; SPACE COMPLEXITY; TIME COMPLEXITY; TRADEOFFS;

REVERSE ENGINEERING;

EID: 33644652516     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1062261.1062335     Document Type: Conference Paper

References (22)

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. C.H. Bennett, P. Gács, M. Li, P.M.B. Vitányi, and W. Zurek. Information Distance, IEEE Transactions on Information Theory, 44:4(1998), 1407-1423.
5. H. Buhrman, J. Tromp, P. Vitanyi, Time and space bounds for reversible simulation, Journal of Physics A: Mathematical and General, 34:35(2001), 6821-6830.
6. R.P. Feynman, Simulating physics with computers, Int. J. Theoret. Physics, 21(1982), 467-488;
7. E. Fredkin and T. Toffoli. Conservative logic. Int. J. Theoret. Phys., 21(1982),219-253.
8. 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.
9. 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.
10. R.W. Keyes, IBM J. Res. Dev., 32(1988), 24-28.
11. R. Landauer. Irreversibility and heat generation in the computing process. IBM J. Res. Develop., 5:183-191, 1961.
12. K.J. Lange, P. McKenzie, and A. Tapp, Reversible space equals deterministic space, J. Comput. System Sci., 60:2(2000), 354-367.
13. n, où θ est un "isomorphisme de codes", Comptes Rendus, 257(1963), 2597-2600.
14. 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.
15. M. Li and P.M.B. Vitányi, Reversibility and adiabatic computation: trading time and space for energy, Proc. Royal Society of London, Series A, 452(1996), 769-789.
16. M. Li and P.M.B. Vitányi. An Introduction to Kolmogorov Complexity and its Applications, Springer-Verlag, New York, 2nd Edition, 1997.
17. M. Li, J. Tromp, and P. Vitányi, Reversible simulation of irreversible computation. Physica D, 120(1998) 168-176.
18. K. Morita, A. Shirasaki, and Y. Gono, A 1-tape 2-symbol reversible Turing machine, IEEE Trans. IEICE, E72 (1989), 223-228.
19. M. Nielsen, I. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000.
20. P.W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput., 26:5(1997), 1484-1509.
21. M. Sipser, Halting space-bounded computation, Theoret. Comp. Sci., 10(1990), 335-338.
22. Ryan Williams, Space-Efficient Reversible Simulations, DIMACS REU report, July 2000. URL http://dimacs.rutgers.edu/~ryanw/