Mod-01 Lec-42 Separation of recursive and r.e. classes, halting problem and its undecidability.
About this video
Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by videoSeparates recursive and recursively enumerable language classes and addresses halting problem undecidability. Shows fundamental limits of computation.
Video by nptelhrd, played through YouTube's embedded player.