Home Courses Theory of Computation Course materials Lectures 2.A: The Turing machine

2.A: The Turing machine

Course week(s) Week 2
Course subject(s) 2: Turing Machines and the Church-Turing Thesis

Description: In this lecture the notion of Turing machine is introduced as a mathematical model of an algorithm. Furthermore, the notions of Turing-recognisable and decidable languages are defined.

Book: Introduction to the Theory of Computation, Chapter 3, pp. 139-149.

Exercises: 3.1, 3.2, 3.5 and 3.8

Key concepts:

  • Problems and Languages
  • Turing Machines
  • Turing-recognizable Languages
  • Turing-decidable Languages
Module 2A
Creative Commons License
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/.
Back to top