Time complexity of tape reduction for reversible turing machines

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

Volumn 7165 LNCS, Issue , 2012, Pages 1-13

  Axelsen, Holger Bock ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY THEORY; INTERNAL STATE; REVERSIBLE COMPUTING; REVERSIBLE TURING MACHINES; STATIC RESOURCE; TIME COMPLEXITY;

COMPUTATIONAL COMPLEXITY; TURING MACHINES;

MACHINERY;

EID: 84857876951     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29517-1_1     Document Type: Conference Paper

References (15)

1. Axelsen, H.B., Glück, R.: A Simple and EfficientUniversal Reversible Turing Machine. In: Dediu, A.-H., Inenaga, S., Martín-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 117-128. Springer, Heidelberg (2011)
2. Axelsen, H.B., Glück, R.: WhatDo Reversible Programs Computě In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 42-56. Springer, Heidelberg (2011)
3. Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525-532 (1973)
4. Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117, 285-306 (1965)
5. Hennie, F.: One-tape, off-line Turing machine computations. Inform. Control 8, 553-578 (1965)
6. Hennie, F., Stearns, R.E.: Two-tape simulation of multitape Turing machines. J. ACM 13(4), 533-546 (1966)
7. Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proc. Foundations of Computer Science, pp. 66-75. IEEE (1997)
8. Landauer, R.: Irreversibility and heatgeneration in the computing process. IBM J. Res. Dev. 5(3), 183-191 (1961)
9. Lange, K.J., McKenzie, P., Tapp, A.: Reversible space equals deterministic space. J. Comput. Syst. Sci. 60(2), 354-367 (2000)
10. Maass, W.: Combinatorial lower bound arguments for deterministic and nondeterministic Turing machines. Trans. Amer. Math. Soc. 292(2), 675-693 (1985)
11. Morita, K., Shirasaki, A., Gono, Y.: A 1-tape 2-symbol reversible Turing machine. Trans. IEICE E 72(3), 223-228 (1989)
12. Pippenger, N., Fischer, M.J.: Relations among complexity measures. J. ACM 26(2), 361-381 (1979)
13. Tadaki, K., Yamakami, T., Lin, J.C.H.: Theory of one-tape linear-time Turing machines. Theor. Comput. Sci. 411(1), 22-43 (2010)
14. Vitányi, P.: Time, space, and energy in reversible computing. In: Proc. Computing Frontiers, pp. 435-444. ACM (2005)
15. Yokoyama, T., Axelsen, H.B., Glück, R.: Optimizing reversible simulation of injective functions. J. Mult.-Val. Log. S. 18(1), 5-24 (2012)