Skip to main content
Springer Nature Link
Log in

New Small Universal Circular Post Machines

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 2001)

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

Included in the following conference series:

Abstract

We consider a new kind of machines with a circular tape and moving in one direction only, so-called Circular Post machines. Using 2-tag systems we construct some new small universal machines of this kind.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Anderaa, S., Fischer, P.: The Solvability of the Halting Problem for 2-state Post Machines. JACM 14 no. 4 (1967) 677–682.

    Article  Google Scholar 

  2. Arbib, M. A.: Theories of Abstract Automata. Prentice Hall, Englewood Cliffs, 1969.

    MATH  Google Scholar 

  3. Baiocchi, C.: Three Small Universal Turing Machines. LNCS 2055 (2001), Accepted for MCU’2001, to appear.

    Google Scholar 

  4. Kudlek, M.: Context Free Normal Systems. Proceedings MFCS’79, LNCS 74 (1979) 346–353.

    Google Scholar 

  5. Kudlek, M.: Small deterministic Turing machines. TCS 168-2 (1996) 241–255.

    Article  MathSciNet  Google Scholar 

  6. Kudlek, M., Rogozhin, Yu.: Small Universal Circular Post Machines. Computer Science Journal of Moldova, 9, no. 10 (2001), Accepted for MCU’2001, to appear.

    Google Scholar 

  7. Kudlek, M., Rogozhin, Yu.: A New Small Universal Turing Machine, submitted (2001).

    Google Scholar 

  8. Margenstern, M.: Frontier between decidability and undecidability: a survey. TCS 231-2 (2000) 217–251.

    Article  MathSciNet  Google Scholar 

  9. Minsky, M. L.: Recursive Unsolvability of Posts Problem of ”tag” and Other Topics in the Theory of Turing Machines. Annals of Math. 74 (1961) 437–454.

    Article  MathSciNet  Google Scholar 

  10. Minsky, M. L.: Size and Structure of universal Turing Machines Using Tag Systems. In Recursive Function Theory, Symposia in Pure Mathematics, AMS 5 (1962) 229–238.

    MathSciNet  Google Scholar 

  11. Minsky, M. L.: Computation: Finite and Infinite Machines. Prentice Hall International, London, 1972.

    Google Scholar 

  12. Nelson, R. J.: Introduction to Automata. John Wiley & Sons, New York, 1968.

    MATH  Google Scholar 

  13. Pavlotskaya, L.: Sufficient conditions for halting problem decidability of Turing machines. Avtomaty i mashiny (Problemi kibernetiki), Moskva, Nauka 33 (1978) 91–118 (in Russian).

    Google Scholar 

  14. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, 1998.

    Google Scholar 

  15. Post, E.: Formal Reduction of the General Combinatorial Decision Problem. Amer. Journ. Math. 65 (1943) 197–215.

    Article  MATH  MathSciNet  Google Scholar 

  16. Robinson, R. M.: Minsky’s Small Universal Turing Machine. Intern. Journ. of Math. 2 no. 5 (1991) 551–562.

    Article  MATH  Google Scholar 

  17. Rogozhin, Yu. V.: Small Universal Turing Machines. TCS 168-2 (1996) 215–240.

    Article  MathSciNet  Google Scholar 

  18. Rogozhin, Yu.: A Universal Turing Machine with 22 States and 2 Symbols. Romanian Journal of Information Science and Technology 1 no. 3 (1998) 259–265.

    Google Scholar 

  19. Shannon, C. E.: A Universal Turing Machine with Two Internal States. In Automata Studies, Ann. Math. Stud. 34, Princeton Uni. Press (1956) 157–165.

    MathSciNet  Google Scholar 

  20. Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York, 1980.

    MATH  Google Scholar 

  21. Salomaa, A.: Theory of Automata. Pergamon Press, Oxford, 1969.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Manfred Kudlek

  2. Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Str. Academiei 5, MD-2028, Chişinău, 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. University of Latvia, Raiņa bulvaris 29, LV-1459, Riga, Latvia

    Rūsiņš Freivalds

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kudlek, M., Rogozhin, Y. (2001). New Small Universal Circular Post Machines. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-44669-9_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42487-1

  • Online ISBN: 978-3-540-44669-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics