skip to main content
article
Free Access

On Formalisms for Turing Machines

Published:01 October 1965Publication History
First page image

References

  1. 1 AANDERAA, S., AND FISCHER, P.C. The solvability of the halting problem for 2-state Post machines. Ia preparation.Google ScholarGoogle Scholar
  2. 2 DAws, M. Computability and Unsolvability. McGraw-Hill, New York, 1958.Google ScholarGoogle Scholar
  3. 3 --. A note on universal Turiag machines. Automata Studies, Princeton U. Press, Princeton, N. J., 1956.Google ScholarGoogle Scholar
  4. 4 HOOPER, P.K. A note on Turing machines. Amer. Math Soc. Notices (Jan. 1965).Google ScholarGoogle Scholar
  5. 5 MINSKY, M. L. Recursive unsolvability of Post's problem of "tag" and other topics in theory of Turing machines. Annal. Math 74 (1961), 437-455.Google ScholarGoogle Scholar
  6. 6 PosT, E.L. Recursive unsolvability of a problem of Thue. J. Symbolic Logic. I2 (1947), 1-11.Google ScholarGoogle Scholar
  7. 7 SHANNON, C. E. A universal Turiag machine with two internal states Automata Studies, Princeton U. Press, Princeton, N. J., 1956.Google ScholarGoogle Scholar
  8. 8 TURING, A. M. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math Soc. 42-2 (1936-37), 230-265; Correction, ibid, 43 (1937), 544-546.Google ScholarGoogle Scholar

Index Terms

  1. On Formalisms for Turing Machines

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image Journal of the ACM
      Journal of the ACM  Volume 12, Issue 4
      Oct. 1965
      167 pages
      ISSN:0004-5411
      EISSN:1557-735X
      DOI:10.1145/321296
      Issue’s Table of Contents

      Copyright © 1965 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 October 1965
      Published in jacm Volume 12, Issue 4

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader