Rice's Theorem Example: Emptiness for Turing Machines

Published: 17 August 2022
on channel: 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.

On this page of the site you can watch the video online Rice's Theorem Example: Emptiness for Turing Machines with a duration of hours minute second in good quality, which was uploaded by the user Easy Theory 17 August 2022, share the link with friends and acquaintances, this video has already been watched 4,606 times on youtube and it was liked by 68 viewers. Enjoy your viewing!

2,474

106