Skip to main content
SpringerLink
Log in

A Universal Turing Machine with 3 States and 9 Symbols

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2295))

Included in the following conference series:

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).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Baiocchi, Three Small Universal Turing Machines. Proc. MCU’2001, ed. M. Margenstern, Yu. Rogozhin, Springer, LNCS 2055, pp. 1–10, 2001.

    Google Scholar 

  2. M.D. Davis and E.J. Weyuker, Computability, Complexity, and Languages. Academic Press, Inc., 1983.

    Google Scholar 

  3. M. Kudlek, Small deterministic Turing machines. Theoretical Computer Science, Elsevier Science B.V., vol. 168 (2), 1996, pp. 241–255.

    Article  MATH  MathSciNet  Google Scholar 

  4. M. Margenstern, Frontier between decidability and undecidability: a survey. Proc. of 2nd International Colloquium Universal Machines and Computations, vol.1, March 23–27, 1998, Metz, France, pp. 141–177.

    Google Scholar 

  5. M.L. Minsky, Size and structure of universal Turing machines using tag systems. Recursive Function Theory, Symp. in pure mathematics, Amer. Math. Soc., 5, 1962, pp. 229–238.

    Google Scholar 

  6. Gh. Păun,DNAComputing Based on Splicing: Universality Results. Proc. of 2nd International Colloquium Universal Machines and Computations, vol.1, March 23–27, 1998, Metz, France, pp. 67–91.

    Google Scholar 

  7. L.M. Pavlotskaya, Sufficient conditions for halting problem decidability of Turing machines. Avtomati i mashini (Problemi kibernetiki), Moskva, Nauka, 1978, vol. 33, pp. 91–118, (Russian).

    Google Scholar 

  8. R.M. Robinson, Minsky’s small universal Turing machine. International Journal of Mathematics, vol.2, N.5, 1991, pp. 551–562.

    Article  MATH  MathSciNet  Google Scholar 

  9. Yu. Rogozhin, Seven universal Turing machines. Systems and Theoretical Programming, Mat. Issled. no.69, Academiya Nauk Moldavskoi SSR, Kishinev, 1982, pp. 76–90, (Russian).

    Google Scholar 

  10. Yu. Rogozhin,A universal Turing machine with 10 states and 3 symbols. Izvestiya Akademii Nauk Respubliki Moldova, Matematika, 1992, N 4(10), pp. 80–82 (Russian).

    Google Scholar 

  11. Yu. Rogozhin, About Shannon’s problem for Turing machines. Computer Science Journal of Moldova, vol.1, no 3(3), 1993, pp. 108–111.

    Google Scholar 

  12. Yu. Rogozhin, Small universal Turing machines. Theoretical Computer Science, Elsevier Science B.V., vol. 168 (2), 1996, pp. 215–240.

    Article  MATH  MathSciNet  Google Scholar 

  13. Yu. Rogozhin,A Universal Turing Machine with 22 States and 2 Symbols. Romanian Journal of Information Science and Technology, vol. 1, N. 3, 1998, pp. 259–265.

    Google Scholar 

  14. C.E. Shannon, A universal Turing machine with two internal states. Automata studies, Ann. of Math. Stud. 34, Princeton, Princeton Univ.Press, 1956, pp. 157–165.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Hamburg, Vogt-Kölln-Straße 30, D-22527, Hamburg, Germany

    Manfred Kudlek

  2. Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Str. Academiei 5, 2028, Chişinău, MD, Republica Moldova

    Yurii Rogozhin

Authors
  1. Manfred Kudlek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yurii Rogozhin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Algebra und Computermathematik Abt. für Theoretische Informatik, Technische Universität Wien, Wiedner Hauptstraße 8-10, 1040, Wien, Austria

    Werner Kuich

  2. Department of Computer Science, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkaisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kudlek, M., Rogozhin, Y. (2002). A Universal Turing Machine with 3 States and 9 Symbols. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-46011-X_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43453-5

  • Online ISBN: 978-3-540-46011-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation