Abstract
We present small polynomial time universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (18, 2). These machines simulate our new variant of tag system, the bi-tag system and are the smallest known universal Turing machines with 5, 4, 3 and 2-symbols respectively. Our 5-symbol machine uses the same number of instructions (22) as the smallest known universal Turing machine by Rogozhin. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Neary, T., & Woods, D. (2007). Four small universal Turing machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4664 LNCS, pp. 242–254). Springer Verlag. https://doi.org/10.1007/978-3-540-74593-8_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
