Skip to main content
SpringerLink
Log in

Turing machines with three states and two symbols, and with one state and n symbols

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. C. E. Shannon, A Universal Turing Machine with Two Internal States, “Automata Studies,” Princeton (1956).

  2. S. Watanabe, “5-symbol 8-state universal Turing machines,” Assoc. Computing Mach.,8, No. 4 (1964), 476–483.

    Google Scholar 

  3. S. Watanabe, “On a minimum universal Turing machine,” MCB Report, Tokyo (1960).

  4. M. Minsky, “Size and structure of universal Turing machines using tag systems,” Proceedings of the 5th Symposium in Pure Mathematics of the American Mathematical Society, V. 5 (1965).

  5. A. Tritter, “Universal Turing machine with 4 symbols and 5 states; Wang Hao, Tag systems and lag systems,” Mathematical Annals (1952), No. 1 (1963), pp. 65–74.

    Google Scholar 

  6. Yu. A. Kryukov, “Turing machines with two symbols and two states,” in: Algebra i Logika,6, (1967).

Download references

Authors
  1. Yu. A. Kryukov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 12–13, January–February, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kryukov, Y.A. Turing machines with three states and two symbols, and with one state and n symbols. Cybern Syst Anal 7, 15–16 (1971). https://doi.org/10.1007/BF01070520

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01070520

Keywords

Search

Navigation