Skip to main content
SpringerLink
Log in

Minimal universal turing machines

  • Brief Communications
  • 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. M. Minsky, Computation: Finite and Infinite Machines, Prentice-Hall, Englewood Cliffs (1967).

    Google Scholar 

  2. Yu. A. Kryukov, “Turing machine with three states and two symbols and with one state and symboi,” Kibernetika, No. 1 (1971).

  3. Yu. V. Rogozhin, Improved Transformation of Shannon Turing Machines [in Russian], Preprint 74-44, Izd. Inst. Kibernetiki, Akad, Nauk UkrSSR, Kiev (1974).

    Google Scholar 

  4. C. E. Shannon, “A universal Turing machine with two internal states,” in. Automata Studies, Princeton University Press, Princeton (1956).

    Google Scholar 

  5. S. Watanabe, “Universal Turing machines with 5 symbols, 8 states, and 5 symbols, 6 states,” in: Cybernetics Collection [Russian translation], No. 6 (1963).

  6. S. Watanabe, On a Minimum Universal Turing Machine, MCB Report, Tokyo (1960).

Download references

Authors
  1. V. N. Karmazin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Transalated from Kibernetika, No. 2, pp. 139–140, March–April, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Karmazin, V.N. Minimal universal turing machines. Cybern Syst Anal 12, 319–320 (1976). https://doi.org/10.1007/BF01069910

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation