Rice's Theorem (Undecidability): 5 Proofs and Examples

Поділитися
Вставка
  • Опубліковано 12 вер 2024
  • Here we show 5 different examples of applying Rice's theorem to languages show that each of these languages are undecidable.
    If you like this content, please consider subscribing to my channel: / @easytheory
    ▶ABOUT ME◀
    I am a professor of Computer Science, and am passionate about it. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.
    The views expressed in this video are not reflective of any of my current or former employers.

КОМЕНТАРІ • 16

  • @na50r24
    @na50r24 9 місяців тому +6

    Maybe this is a dumb question but how does this make even sense?
    Non-trivial: Come up with two random turning machines (M_1, M_2), where one is inside the language of the problem and the other is not.
    Property of TM languages: Make some weird claim about two other random turning machines (X_1, X_2) that have seemingly zero relation to M_1 and M_2 defined prior.
    By Rice's theorem, problem is undeciable.
    I could still follow with the non-trivial part, since M_1 and M_2 two had some kind of connection to the actual problem but Property of TM languages is like making some random unrelated statement, so I don't understand how this is supposed to work.

  • @francescoboraso6190
    @francescoboraso6190 Рік тому +14

    Nobody is commenting on the thumbnail? Just brilliant, 5 rice bowls and a woman should grab everybody's attention 🤣

    • @vlogesh29
      @vlogesh29 7 місяців тому +1

      Absolutely

  • @kattenelvis1778
    @kattenelvis1778 2 роки тому +12

    How we need a Rice-Curry Theorem and my life will be complete. Sadly, Rice and Curry never collaborated with eachother.

  • @wizardwarrior26
    @wizardwarrior26 Рік тому +2

    Yay! thanks man you saved my day and the exam

  • @317sam
    @317sam Рік тому +1

    How can we just say if L(M1) = L(M2) ? Shouldn't we prove it?

  • @aseratawya6943
    @aseratawya6943 4 місяці тому

    Thanks, Boss

  • @ZuhairKhouri2003
    @ZuhairKhouri2003 10 місяців тому

    can you just put the accept state there with no transitions to it?

  • @s2260
    @s2260 Рік тому +2

    Professor, can you tell me how I can reduce epsilon accept problem to acceptance problem?

  • @johnbrownell1
    @johnbrownell1 Рік тому +4

    It kills me that you put a hot girl pic to bait people to watch this but tbh it worked on me😆

  • @s2260
    @s2260 Рік тому

    Consider a set of Turing transducers {T# | T maps epsilon to epsilon} is this decidable or undecidable?

  • @cadenc2927
    @cadenc2927 9 місяців тому +1

    What's going on with that thumbnail, Easy Theory? Care to explain?

  • @DeepakYadav-ys7dg
    @DeepakYadav-ys7dg 4 місяці тому

    I've been cheated by the thumbnail

  • @knownlearner568
    @knownlearner568 2 роки тому

    RICE: IN SOUTH INDIA WE EAT DAILY.🤪🇮🇳