Mod-13 Lec-04 Undecidability3

Why it's on BrighterTube

Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Undecidability proofs and problem reduction in complexity theory. University-level theory lecture on problems with no algorithmic solution.

What you'll learn

A 52-minute video from nptelhrd: “Mod-13 Lec-04 Undecidability3”.

Video by nptelhrd, played through YouTube's embedded player.

Part of Mathematics - Formal Languages and Automata Theory