NPTEL Video Course : Theory of Automata, Formal Languages and Computation

Lecture 32 - Problems and Instances, Universal TM, Decidability