ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
A simplified universal Turing machine
Full text PdfPdf (417 KB)
Source ACM Annual Conference/Annual Meeting archive
Proceedings of the 1952 ACM national meeting (Toronto) table of contents
Toronto, Ontario, Canada
Pages: 50 - 54  
Year of Publication: 1952
Author
E. F. Moore
Sponsors
University of Toronto : University of Toronto
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 47,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800259.808993
What is a DOI?

ABSTRACT

In 1936 Turing (1) defined a class of logical machines (which he called a - machines, but which are now generally called Turing machines) which he used as an aid in proving certain results in mathematical logic, and which should prove of interest in connection with the theory of control and switching systems. Given any logical operation or arithmetical computation for which complete instructions for carrying out can be supplied, it is possible to design a Turing machine which can perform this operation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Turing, A. M., On computable numbers, with an application to the Entscheldungs problem, Proc. Lond. Math. Soc. Series 2, Vol. 24, pp. 230-265, 1936.

CITED BY  3
Saul Gorn, Specification languages for mechanical languages and their processors a baker's dozen: a set of examples presented to ASA x3.4 subcommittee, Communications of the ACM, v.4 n.12, p.532-542, Dec. 1961
Hao Wang, A Variant to Turing's Theory of Computing Machines, Journal of the ACM (JACM), v.4 n.1, p.63-92, Jan. 1957
Damien Woods , Turlough Neary, The complexity of small universal Turing machines: A survey, Theoretical Computer Science, v.410 n.4-5, p.443-450, February, 2009

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Bounded-action devices (e.g., Turing machines, random access machines)


General Terms:
Theory

Collaborative Colleagues:
E. F. Moore: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player