Uploaded March 2018 | Updated September 2026, 58 minutes 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: resource-bounded computation, time and space complexity classes, time-space usage and tradeoffs, P / NP / PSPACE / EXPTIME / EXPSPACE / LOGSPACE, space-time relationships, re-usability of space, non-re-usability of time, Genie-in-a-Bottle, eliminating non-determinism w.r.t. time and space, Savitch's theorem, Chomsky hierarchy reloaded, infinite time complexity hierarchy, infinite space complexity hierarchy, revisiting diagonalization / dovetailing /pigeon-hole principle, pathological / non-computable resource bounds / functions
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: resource-bounded computation, time and space complexity classes, time-space usage and tradeoffs, P / NP / PSPACE / EXPTIME / EXPSPACE / LOGSPACE, space-time relationships, re-usability of space, non-re-usability of time, Genie-in-a-Bottle, eliminating non-determinism w.r.t. time and space, Savitch's theorem, Chomsky hierarchy reloaded, infinite time complexity hierarchy, infinite space complexity hierarchy, revisiting diagonalization / dovetailing /pigeon-hole principle, pathological / non-computable resource bounds / functions
