Scribd Logo
Upload

Welcome to Scribd!

  • Turing Machine

    Uploaded by

    Revthi Sanker
    4 views1 page
    A Turing machine is a theoretical device that manipulates symbols on a strip of tape according to a table of rules. It can be adapted to simulate the logic of any computer algorithm, and is particularly useful in explaining the functions of a CPU inside a computer. One turing machine which is able to simulate another is called a Universal TM.(UTM)

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    A Turing machine is a theoretical device that manipulates symbols on a strip of tape according to a table of rules. It can be adapted to simulate the logic of any computer algorithm, and is particularly useful in explaining the functions of a CPU inside a computer. One turing machine which is able to simulate another is called a Universal TM.(UTM)

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views1 page

    Turing Machine

    Uploaded by

    Revthi Sanker
    A Turing machine is a theoretical device that manipulates symbols on a strip of tape according to a table of rules. It can be adapted to simulate the logic of any computer algorithm, and is particularly useful in explaining the functions of a CPU inside a computer. One turing machine which is able to simulate another is called a Universal TM.(UTM)

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Turing machine:

    • Alan turing 1937


    • Intelligent machining
    • Logical computing machine
    • A Turing machine is a theoretical device that manipulates symbols on a strip of tape
    according to a table of rules. Despite its simplicity, a Turing machine can be adapted
    to simulate the logic of any computer algorithm, and is particularly useful in explaining
    the functions of a CPU inside a computer.
    • Thought of concept not pragmatic
    • One turing machine which is able to simulate another is called a Universal
    TM.(UTM)

    Biomolecular computing:

    You might also like