Skip to content

Decidable iff Recognizable and co-Recognizable Proof

Easy Theory40.8K subscribers

9,626 views

About this video

From a channel a BrighterTube curator vetted

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

Video by Easy Theory, played through YouTube's embedded player.

Part of Decidable Languages - Easy Theory, Undecidable Languages - Easy Theory, "Intro" Theory of Computation Lectures - Easy Theory