Algorithmic Problem Solving: Intro
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 62-minute video from Easy Theory's catalogue; the title names its topic.
Video by Easy Theory, played through YouTube's embedded player.
Go deeper
As an Amazon Associate, BrighterTube earns from qualifying purchases. Picked by hand for this subject; nobody paid to be listed.