Scribd Logo
Upload

Welcome to Scribd!

  • 1 views

    Rice's Theorem

    Uploaded by

    kavinjothi18
    Rice in toc

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    Rice's Theorem

    Uploaded by

    kavinjothi18
    1 views9 pages
    Rice in toc

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Rice in toc

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    1 views9 pages

    Rice's Theorem

    Uploaded by

    kavinjothi18
    Rice in toc

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 9

    Rice’s Theorem

    A proof for “undecidability” of languages of


    certain form
    Non-Trivial property
    • A property possessed by some Turing-acceptable languages but not
    all TMs

    Exampl
    e:
    : is : has size
    empty? 2? N
    YE
    S O
    N
    N O
    O YE
    N S
    Trivial Property
    A property possessed by ALL Turing-acceptable languages

    : has size at
    least
    True0?for all
    languages

    : is accepted by some Turing


    machine?
    True for all Turing-acceptable languages
    Language L has property P
    • We can describe a property, P as the set of languages that possess the
    property
    • If language has property then, L ∈ P

    Exampl
    Suppose
    e: alphabet
    : is : is has size
    1?N
    empty?
    YE YEO
    SN S
    N
    O
    N O
    O
    Non-trivial property problem
    • Input: Turing Machine, M
    • Question: Does L(M) have the non-trivial property P? L(M)∈P

    • Corresponding language:
    Rice’s Theorem
    • Determining whether a TM satisfies any non-trivial property is
    undecidable [i.e. is
    undecidable]

    • A property is non-trivial if:


    1. It depends only on the language of M, and

    2. Some, but not all, Turing machines have the property

    • Examples: Is L(M) regular? A CFG? Finite?


    Non-Trivial property of Languages of
    TMs
    • Property, P is said to be a Non-Trivial property of Languages of TMs if
    there exists TMs, M1 and M2 such that P(L(M1)) = 1 and P(L(M2)) = 0 then,

    • There is some TM, M1 whose language, L satisfies the property, P i.e. P(L(M1)) = 1

    • There is some TM, M2 whose language, L does not satisfies the property, P i.e.

    P(L(M2)) = 0
    Rice Theorem - Statement
    • Let P be a Non-Trivial property of languages of TMs then the
    languages, Lp = {<M> | P(L(M)) = 1} is undecidable.

    Encodings Language of
    of TM TM satisfying P
    • Note:
    • If the encodings of TM does not satisfy the properties of language, L then, Lp =
    {<M> | P(L(M)) = 0} is also undecidable because decidable problems are
    closed under complement.
    The Rice Theorem states that any non-trivial property (a property that is true for some but not all possible
    languages) of a recursively enumerable set (a set of strings that can be recognized by a Turing machine) is
    undecidable.

    In other words, it is impossible to write a general algorithm that can determine whether an arbitrary Turing
    machine recognizes a language with a specific non-trivial property.

    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