Theory of Computation (CS6160) Lecture 07 (Part 2 of 2), Professor Gabriel Robins @GabrielRobins
Theory of Computation (CS6160) Lecture 07 (Part 2 of 2), Professor Gabriel Robins  @GabrielRobins
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
Theory of Computation (CS6160) Lecture 07 (Part 2 of 2), Professor Gabriel RobinsTheory of Computation (CS6160) Lecture 04 (Part 2 of 2), Professor Gabriel RobinsAnna & Cristian dancing Tango (Vals), May 2025Algorithms Lecture 15, Oct 17, 2019Algorithms   Lecture 14, Oct 15, 2019Algorithms Lecture 24, Nov 19, 2019   PanoptoTheory of Computation (CS3102), Lecture 17, Professor Gabriel Robins, Spring 2018Emily and Tony dancing, Nov 6, 2025Adam playing the flute while touring the Saint Minas Villa in Greece, June 2026Theory of Computation (CS3102), Lecture 26, Professor Gabriel Robins, Spring 2018 PanoptoTheory of Computation (CS3102), Lecture 18, Professor Gabriel Robins, Spring 2018Alex and Gabe dancing
Gabriel Robins |

Theory of Computation (CS6160) Lecture 07 (Part 2 of 2), Professor Gabriel Robins

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER