Scribd Logo
Upload

Welcome to Scribd!

  • 19 views

    Handout 10

    Uploaded by

    amos4354
    This document discusses variations of the Turing machine model and their equivalence in computational power. It contains the following key points: 1) A two-tape deterministic Turing machine can be simulated by a single-tape deterministic Turing machine, showing that adding resources does not increase computational power. 2) A nondeterministic Turing machine can be simulated by a deterministic Turing machine with multiple tapes, showing that nondeterminism does not increase computational power. 3) Positive boolean operations (union and intersection) on the languages of deterministic Turing machines result in languages that are also deterministic Turing machine recognizable. 4) While the languages of deterministic Turing machines are closed under complement, the recursively enum

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    Handout 10

    Uploaded by

    amos4354
    19 views1 page
    This document discusses variations of the Turing machine model and their equivalence in computational power. It contains the following key points: 1) A two-tape deterministic Turing machine can be simulated by a single-tape deterministic Turing machine, showing that adding resources does not increase computational power. 2) A nondeterministic Turing machine can be simulated by a deterministic Turing machine with multiple tapes, showing that nondeterminism does not increase computational power. 3) Positive boolean operations (union and intersection) on the languages of deterministic Turing machines result in languages that are also deterministic Turing machine recognizable. 4) While the languages of deterministic Turing machines are closed under complement, the recursively enum

    Original Title

    handout-10

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses variations of the Turing machine model and their equivalence in computational power. It contains the following key points: 1) A two-tape deterministic Turing machine can be simulated by a single-tape deterministic Turing machine, showing that adding resources does not increase computational power. 2) A nondeterministic Turing machine can be simulated by a deterministic Turing machine with multiple tapes, showing that nondeterminism does not increase computational power. 3) Positive boolean operations (union and intersection) on the languages of deterministic Turing machines result in languages that are also deterministic Turing machine recognizable. 4) While the languages of deterministic Turing machines are closed under complement, the recursively enum

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    19 views1 page

    Handout 10

    Uploaded by

    amos4354
    This document discusses variations of the Turing machine model and their equivalence in computational power. It contains the following key points: 1) A two-tape deterministic Turing machine can be simulated by a single-tape deterministic Turing machine, showing that adding resources does not increase computational power. 2) A nondeterministic Turing machine can be simulated by a deterministic Turing machine with multiple tapes, showing that nondeterminism does not increase computational power. 3) Positive boolean operations (union and intersection) on the languages of deterministic Turing machines result in languages that are also deterministic Turing machine recognizable. 4) While the languages of deterministic Turing machines are closed under complement, the recursively enum

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 1

    Informatique Théorique Spring 2011

    Handout 10: More about Turing Machines

    10.1 Robustness. Many variations of the Turing machine model are equally powerful. This can be
    shown by simulating the variation on the model by a standard TM. For example, a DTM M with two
    tapes can be simulated by a standard DTM M 0 (with one tape):
    A configuration (q, u1 , a1 , v1 , u2 , a2 , v2 ) of the two-tape machine corresponds to the configu-
    ration (q, ε, #, u1 $a1 v1 #u2 $a2 v2 ) of the one-tape machine (the $ symbols mark the positions
    of the two r/w heads). The two machines start in corresponding configurations. For every
    transition t of the two-tape machine M , the one-tape machine M 0 performs a finite sequence
    t1 , . . . , tn of transitions such that the two machines are again in corresponding configurations.
    Note that this simulation preserves acceptance, rejection, and looping. Since the simulation preserves
    acceptance, it follows that the two-tape TMs accept no more than the r.e. languages. Since the simulation
    preserves also looping, it follows that the two-tape Turing deciders accept no more than the recursive
    languages.

    10.2 Nondeterminism. A nondeterministic TM M can be simulated by a three-tape DTM (see pages


    152–153 of Sipser), and hence (using a simulation like the one of Section 10.1), by a standard DTM M 0 .
    The simulation is such that for every input word w,
    1. if some run of M over w accepts, then the run of M 0 over w accepts;
    2. if all runs of M over w reject, then the run of M 0 over w rejects;
    3. if no run of M over w accepts, and some run of M over w loops, then the run of M 0 over w loops.
    Therefore, the nondeterministic TMs accept the r.e. languages. For a nondeterministic Turing decider,
    the simulation can be adapted so that it always halts. As a result, it follows that nondeterministic Turing
    deciders accept the recursive languages.

    10.3 Positive boolean operations. Given two DTMs M1 and M2 , we can construct a single DTM
    M that encodes the two tapes of M1 and M2 similar to the construction of Section 10.1, and alternates
    between simulating a transition of M1 and simulating a transition of M2 .
    Union As soon as one of M1 or M2 accepts, let M accept. Once both M1 and M2 have rejected, let M
    reject. Consequently, if neither M1 nor M2 accepts, and M1 or M2 loops, then M will loop.
    Intersection As soon as one of M1 or M2 rejects, let M reject. Once both M1 and M2 have accepted,
    let M accept. Consequently, if M1 or M2 loops, and neither M1 nor M2 rejects, then M will loop.
    It follows that the recursive languages are closed under union and intersection, and that the r.e. languages
    are closed under union and intersection.

    10.4 Complementation. Given a DTM M , let M be the DTM that results from M by swapping qa
    and qr . If M is a Turing decider, then L(M ) = Σ∗ \L(M ). It follows that the recursive languages are
    closed under complementation. However, if M loops on some inputs, then L(M ) ⊂ Σ∗ \L(M ). So, the
    r.e. languages may not be closed under complementation. A language L is co-r.e. if there is a DTM M
    such that L(M ) = Σ∗ \L; that is, M accepts the complement of M . For r.e. languages L, there is a DTM
    that is guaranteed to accept all inputs that are in L, but it may not halt on inputs that are not in L.
    For co-r.e. languages L, there is a DTM that is guaranteed to reject all inputs that are not in L, but it
    may not halt on inputs that are in L.
    Theorem. A language L is recursive iff L is both r.e. and co-r.e.
    We will soon see a language that is r.e. but not recursive, namely, the membership problem for DTMs.
    It follows that r.e. and co-r.e. are different language classes.

    1
    c T.A. Henzinger, G. Théoduloz

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy