Theory of Computation (CS3102), Lecture 13, Professor Gabriel Robins, Spring 2018 (Panopto) @GabrielRobins
Theory of Computation (CS3102), Lecture 13, Professor Gabriel Robins, Spring 2018 (Panopto)  @GabrielRobins
Uploaded March 2018 | Updated November 2026, 5 days ago
This lecture is part of a course on the Theory of Computation, by Professor Gabriel Robins at the University of Virginia (CS3102 Spring 2018), with PowerPoint slides at http://www.cs.virginia.edu/~robins/cs3102 and other related videos at http://www.cs.virginia.edu/~robins/videos.html

Specific topics covered in this lecture: Turing machine "enhancements", larger alphabets, double-sided infinite tapes, multiple heads, multiple tapes, higher-dimensional tapes, non-determinism, combinations of enhancements, commutativity of compositions, equivalent TMs and programs, recognizability vs. decidability vs. enumerability, decidability and lexicographic orders, recognizability and enumerability, parallel simulation, non-response vs. explicit no, "simple" examples of recognizable non-decidable sets
Theory of Computation (CS3102), Lecture 13, Professor Gabriel Robins, Spring 2018 (Panopto)Theory of Computation (CS3102), Lecture 28, Professor Gabriel Robins, Spring 2018 Panopto HiResAlgorithms Lecture 24, Nov 19, 2019Tim and Boris dancing, Sept 2025Tims dance workshop - Salsa basic, Sept 27, 2025Theory of Computation (CS3102), Lecture 10, Professor Gabriel Robins, Spring 2018Algorithms Lecture 05, Sept 10, 2019 - PanoptoAlgorithms Lecture 15, Oct 17, 2019 - Part 1 of 2Tim and Gabe dancing, June 3, 2026Theory of Computation CS6160 Lecture 13 part 1 of 2 Gabriel Robins Spring 2018Natalie and Tim dancing at Smooth Sailing Ballroom studio Latin party, March 13, 2026Berenika and Alp dancing
Gabriel Robins |

Theory of Computation (CS3102), Lecture 13, Professor Gabriel Robins, Spring 2018 (Panopto)

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER