Abstract
A reversible Turing machines is a computing model with a "backward deterministic" property, which is closely related to physical reversibility. In this paper, we study the problem of finding a small universal reversible Turing machine (URTM). As a result, we obtained a 17-state 5-symbol URTM in the quintuple form that can simulate any cyclic tag system. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Morita, K., & Yamaguchi, Y. (2007). A universal reversible turing machine. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4664 LNCS, pp. 90–98). Springer Verlag. https://doi.org/10.1007/978-3-540-74593-8_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
