Home Courses Theory of Computation Course materials Lectures 2.B: Variants of Turing machines

2.B: Variants of Turing machines

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

Description: As a first variant the multi-tape Turing machine is introduced. The computational equivalence of multi-tape Turing machines and ordinary Turing machines is shown. As a second variant the non-deterministic Turing machine is defined. It is explained how all possible computations by such a Turing machine can be represented in a single computation tree.

Book: Introduction to the Theory of Computation, Chapter 3, pp. 150-152.

Exercises: 3.10, 3.11, 3.12 and 3.13

Key concepts:

  • Multitape Turing Machines
  • Equivalence Singletape TMs and multitape TMs
  • Nondeterministic Turing Machines
Module 2B
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