Rice's Theorem Example: Emptiness for Turing Machines

Pubblicato il: 17 agosto 2022
sul canale di: 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.

In questa pagina del sito puoi guardare il video online Rice's Theorem Example: Emptiness for Turing Machines della durata di ore minuti seconda in buona qualità , che l'utente ha caricato Easy Theory 17 agosto 2022, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 4,606 volte e gli è piaciuto 68 spettatori. Buona visione!

2,474

106