Undecidability in 2 Hours (A_TM, Rice's Theorem, LBAs, EQ_CFG)

(I know there's a video/audio sync issue, I can't find a way to fix it, sorry! This is the recorded version of the livestream, so shouldn't have any dropped frames.) Here we cover everything to do with undecidability, such as the A_TM and E_TM problems. Also we do Rice's theorem, and show that certain problems for linear bounded automata (LBAs) and context-free grammars are undecidable. Easy Theory Website: https://www.easytheory.org Become a member:    / @easytheory   Donation (appears on streams): https://streamlabs.com/easytheory1/tip Paypal: https://paypal.me/easytheory Patreon:   / easytheory   Discord:   / discord   #easytheory Youtube Live Streaming (Sundays) - subscribe for when these occur. Social Media: Facebook Page:   / easytheory   Facebook group:   / easytheory   Twitter:   / easytheory   Merch: Language Hierarchy Apparel: https://teespring.com/language-hierar... Pumping Lemma Apparel: https://teespring.com/pumping-lemma-f... If you like this content, please consider subscribing to my channel:    / @easytheory   Gold Supporters: Micah Wood Silver Supporters: Timmy Gy ▶SEND ME THEORY QUESTIONS◀ ryan.e.dougherty@icloud.com ▶ABOUT ME◀ I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.