Uploaded March 2018 | Updated November 2026, 2 days ago
This lecture is part of a course on the Theory of Computation, by Professor Gabriel Robins at the University of Virginia (CS6160 Spring 2018), with PowerPoint slides at http://www.cs.virginia.edu/~robins/cs6160/ and other related videos at http://www.cs.virginia.edu/robins/videos.html
Specific topics covered in this lecture: Godel, incompleteness, automatic theorem proving, soundness, completeness, consistency, catastrophic inconsistency, Godel's incompleteness theorem, propositional logic, is mathematics consistent?, Church, Lambda calculus, Turing, halting problem, Russell's paradox, Lego / Mechano / Tinker Toy computers, nuts-and-bolts / hydraulic computers, smallest universal Turing machine, neural nets, oracles, hyper-computation, undecidability hierarchy, Turing degrees, the usefulness of negative / impossibility results
This lecture is part of a course on the Theory of Computation, by Professor Gabriel Robins at the University of Virginia (CS6160 Spring 2018), with PowerPoint slides at http://www.cs.virginia.edu/~robins/cs6160/ and other related videos at http://www.cs.virginia.edu/robins/videos.html
Specific topics covered in this lecture: Godel, incompleteness, automatic theorem proving, soundness, completeness, consistency, catastrophic inconsistency, Godel's incompleteness theorem, propositional logic, is mathematics consistent?, Church, Lambda calculus, Turing, halting problem, Russell's paradox, Lego / Mechano / Tinker Toy computers, nuts-and-bolts / hydraulic computers, smallest universal Turing machine, neural nets, oracles, hyper-computation, undecidability hierarchy, Turing degrees, the usefulness of negative / impossibility results










