Rice's Theorem Example: Emptiness for Turing Machines

Publicado em: 17 Agosto 2022
no canal de: Easy Theory

4,606

Here we prove that the emptiness problem for Turing Machines is undecidable via Rice's theorem; this problem is also known as the E_TM problem. This is a simple application of Rice, and all we need to do is to show that the language is a nontrivial property of TM languages. The example TMs needed are very easy and straightforward.

Easy Theory Website: https://www.easytheory.org
Discord: / discord

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.

Nesta página do site você pode assistir ao vídeo on-line Rice's Theorem Example: Emptiness for Turing Machines duração hora minuto segundo em boa qualidade , que foi baixado pelo usuário Easy Theory 17 Agosto 2022, compartilhe o link com seus amigos e conhecidos, no youtube este vídeo já foi visto 4,606 vezes e gostou 68 espectadores. Boa visualização!

2,474

106