Lectures

• 1: Preliminaries – Automata and Languages

  Subject(s) 1: Preliminaries – Automata and Languages
  Week(s) Week 1
  

• 2.A: The Turing machine

  Subject(s) 2: Turing Machines and the Church-Turing Thesis
  Week(s) Week 2
  

• 2.B: Variants of Turing machines

  Subject(s) 2: Turing Machines and the Church-Turing Thesis
  Week(s) Week 2
  

• 2.C: Non-deterministic Turing machines and their equivalence to ordinary Turing machines

  Subject(s) 2: Turing Machines and the Church-Turing Thesis
  Week(s) Week 2
  

• 2.D: Enumerators and Hilbert’s tenth problem

  Subject(s) 2: Turing Machines and the Church-Turing Thesis
  Week(s) Week 2
  

• 2.E: The entscheidungsproblem, the Church-turing thesis, and the coding of Turing machines and problems

  Subject(s) 2: Turing Machines and the Church-Turing Thesis
  Week(s) Week 2
  

• 3.A: Infinity, hotel Hilbert, and countable and uncountable sets

  Subject(s) 3: Decidabillity
  Week(s) Week 3
  

• 3.B: Decidable problems, the Halting Problem and its undecidability, and Universal Turing Machines

  Subject(s) 3: Decidabillity
  Week(s) Week 3
  

• 4.A: Reductions and direct reduction

  Subject(s) 4: Reducibility
  Week(s) Week 4
  

• 4.B: Computable functions and mapping reduction

  Subject(s) 4: Reducibility
  Week(s) Week 4
  

Theory of Computation by TU Delft OpenCourseWare is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Based on a work at https://ocw.tudelft.nl/courses/theory-of-computation/.