Acceptance for Turing Machines is Undecidable, but Recognizable
Why it's on BrighterTube
From a channel a BrighterTube curator approved in full · 80% confidenceFrom a channel Lumen includes in full: Easy Theory, by CS lecturer Ryan Dougherty, works complete proofs and examples in automata theory, computability and complexity — DFAs, pumping lemma, Turing machines, NP-completeness reductions — at university-course depth.
What you'll learn
A 12-minute video from Easy Theory's catalogue; the title names its topic.
Video by Easy Theory, played through YouTube's embedded player.
Part of Undecidable Languages - Easy Theory, "Intro" Theory of Computation Lectures - Easy Theory
Go deeper
As an Amazon Associate, BrighterTube earns from qualifying purchases. Picked by hand for this subject; nobody paid to be listed.