skip to main content
10.1145/800259.808993acmconferencesArticle/Chapter ViewAbstractPublication Pagesacm-national-conferenceConference Proceedingsconference-collections
Article
Free access

A simplified universal Turing machine

Published: 01 June 1952 Publication History

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.

Reference

[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

View all
  • (2018)Less Is More in the Fifties: Encounters between Logical Minimalism and Computer Design during the 1950sIEEE Annals of the History of Computing10.1109/MAHC.2018.01217126540:1(19-45)Online publication date: Jan-2018
  • (2012)The complexity of small universal turing machinesProceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science10.1007/978-3-642-27660-6_32(385-405)Online publication date: 21-Jan-2012
  • (2011)Towards methods for discovering universal Turing machines (or how universal unicorns can be discovered, not created)Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 11910.5555/2483191.2483210(151-160)Online publication date: 17-Jan-2011
  • Show More Cited By

Index Terms

  1. A simplified universal Turing machine

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ACM '52: Proceedings of the 1952 ACM national meeting (Toronto)
    September 1952
    160 pages
    ISBN:9781450379250
    DOI:10.1145/800259
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 June 1952

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)90
    • Downloads (Last 6 weeks)16
    Reflects downloads up to 20 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2018)Less Is More in the Fifties: Encounters between Logical Minimalism and Computer Design during the 1950sIEEE Annals of the History of Computing10.1109/MAHC.2018.01217126540:1(19-45)Online publication date: Jan-2018
    • (2012)The complexity of small universal turing machinesProceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science10.1007/978-3-642-27660-6_32(385-405)Online publication date: 21-Jan-2012
    • (2011)Towards methods for discovering universal Turing machines (or how universal unicorns can be discovered, not created)Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 11910.5555/2483191.2483210(151-160)Online publication date: 17-Jan-2011
    • (2011)Towards methods for discovering universal Turing machines (or how universal unicorns can be discovered, not created)Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 11910.5555/2461196.2461215(151-160)Online publication date: 17-Jan-2011
    • (2004)Using circuits and systems-level research to drive nanotechnologyIEEE International Conference on Computer Design: VLSI in Computers and Processors, 2004. ICCD 2004. Proceedings.10.1109/ICCD.2004.1347937(302-309)Online publication date: 2004
    • (1971)BibliographyLogic, Automata, and Algorithms10.1016/S0076-5392(08)62337-1(409-426)Online publication date: 1971
    • (1967)Nachrichtenverarbeitende SystemeTaschenbuch der Nachrichtenverarbeitung10.1007/978-3-662-00505-7_10(965-1292)Online publication date: 1967
    • (1964)Mechanical languagesCommunications of the ACM10.1145/364005.3640357:4(219-222)Online publication date: Apr-1964
    • (1961)Specification languages for mechanical languages and their processors a baker's dozenCommunications of the ACM10.1145/366853.3668564:12(532-542)Online publication date: 1-Dec-1961
    • (1961)The Theory of Automata, a SurveyAdvances in Computers Volume 210.1016/S0065-2458(08)60144-8(379-421)Online publication date: 1961
    • Show More Cited By

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Login options

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media