Skip to content

Introduction to the Theory of Computation (Full Course)

Easy Theory40.8K subscribers

7,727 views

About this video

Intro · 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 Background Material - Easy Theory