Undecidability of the Emptiness Problem for Turing Machines via Rice's Theorem

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: https://discord.gg/SD4U3hs

If you like this content, please consider subscribing to my channel: https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg?sub_confirmation=1

▶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.