A universal reversible turing machine

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

Volumn 4664 LNCS, Issue , 2007, Pages 90-98

  Morita, Kenichi ^a   Yamaguchi, Yoshikazu ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Cyclic tag system; Reversible computing; Universal Turing machine

Indexed keywords

COMPUTATION THEORY; COMPUTER SIMULATION; MATHEMATICAL MODELS;

CYCLIC TAG SYSTEM; REVERSIBLE COMPUTING;

TURING MACHINES;

EID: 37849023527     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74593-8_8     Document Type: Conference Paper

References (16)

1. Baiocchi, C.: Three small universal Turing machines. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 1-10. Springer, Heidelberg (2001)
2. Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525-532 (1973)
3. Cook, M.: Universality in elementary cellular automata. Complex Systems 15, 1-40 (2004)
4. Woods, D., Neary, T.: On the time complexity of 2-tag systems and small universal Turing machines. In: Proc. of 47th Symposium on Foundations of Computer Science (FOCS), pp. 439-446 (2006)
5. Fredkin, E., Toffoli, T.: Conservative logic. Int. J. Theoret. Phys. 21, 219-253 (1982)
6. Kudlek, M., Rogozhin, Y.: A universal Turing machine with 3 states and 9 symbols. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 311-318. Springer, Heidelberg (2002)
7. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)
8. Morita, K., Shirasaki, A., Gono, Y.: A 1-tape 2-symbol reversible Turing machine. Trans. IEICE Japan E-72, 223-228 (1989)
9. Morita, K., Harao, M.: Computation universality of one-dimensional reversible (injective) cellular automata. Trans. IEICE Japan E-72, 758-762 (1989)
10. Morita, K.: A simple universal logic element and cellular automata for reversible computing. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 102-113. Springer, Heidelberg (2001)
11. Morita, K., Ogiro, T.: Simple universal reversible cellular automata in which reversible logic elements can be embedded. IEICE Trans. on Information and Systems E87-D, 650-656 (2004)
12. Morita, K.: Simple universal one-dimensional reversible cellular automata. Journal of Cellular Automata (in press)
13. Rogozhin, Y.: Small universal Turing machines. Theoretical Computer Science 168, 215-240 (1996)
14. Rogozhin, Y.: A universal Turing machine with 22 states and 2 symbols. Romanian J. Inform. Sci. Technol. 1, 259-265 (1998)
15. Toffoli, T.: Reversible computing. In: de Bakker, J.W., van Leeuwen, J. (eds.) Automata, Languages and Programming. LNCS, vol. 85, pp. 632-644. Springer, Heidelberg (1980)
16. Toffoli, T.: Bicontinuous extensions of invertible combinatorial functions. Mathematical Systems Theory 14, 12-23 (1981)