NPTEL Video Course : Theory of Automata, Formal Languages and Computation
Lecture 31 - Recursive Sets, Recursively Innumerable Sets, Encoding of TM, Halting Problem
Home
Previous
Next
Thumbnails