Errol Martin's "Computability and Incompleteness"
These videos cover challenging topics mentioned earlier in this unit. Watch the first lecture to learn about Hilbert's consistency program, Godels incompleteness theorem, attributes of computable functions, Church's thesis, and three approaches to computability, paying particular attention to the examples. In the second video, will learn about the Halting problem, universal Turing machine, and the undecidability proof.
Click http://videolectures.net/ssll09_martin_cai/ link to open resource.