Skip to main content
Conference Proceedings

A universal turing machine with 3 states and 9 symbols

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2295 LNCS 311-318
DOI: 10.1007/3-540-46011-x_27
25Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With an UTM(3,9) we present a new small universal Turing machine with 3 states and 9 symbols, improving a former result of an UTM(3,10). © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Kudlek, M., & Rogozhin, Y. (2002). A universal turing machine with 3 states and 9 symbols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2295 LNCS, pp. 311–318). Springer Verlag. https://doi.org/10.1007/3-540-46011-x_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free