Rice's Theorem Example: Emptiness for Turing Machines

Publicado el: 17 agosto 2022
en el 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.

En esta página del sitio puede ver el video en línea Rice's Theorem Example: Emptiness for Turing Machines de Duración hora minuto segunda en buena calidad , que subió el usuario Easy Theory 17 agosto 2022, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 4,606 veces y le gustó 68 a los espectadores. Disfruta viendo!

2,666