Undergrad Complexity at CMU - Turing Machines

Explore the fundamental concepts of Turing Machines in this comprehensive lecture from Carnegie Mellon University's Undergraduate Computational Complexity Theory course. Delve into the formalization of computation, the Turing Thesis, and the Extended Church-Turing Thesis. Examine the structure and functionality of Turing Machines through detailed examples and learn how to define algorithms mathematically. Gain a deeper understanding of computational theory as presented by Professor Ryan O'Donnell in this 80-minute session, which forms part of CMU's Course 15-455 from Spring 2017. Supplement your learning with suggested readings from Sipser's Chapter 3.1 and 3.3, and enhance your practical understanding by exploring the interactive Turing Machine simulator available online.

Introduction
Formalization
Turing Thesis
Extended Churchturing Thesis
Turing Machines
Turing Machine Example
Algorithm Definition
Mathematical Definition