[Modules] [Syllabus]

Module #6: Turing Machines

Objectives

  1. Determine languages detectable by computational devices
  2. Define Turing Machine
  3. Use Turing Machines to recognize languages
  4. Use Turing machines to perform computations
  5. Create Turing machines for languages or computations

Topics

  1. Turing Machines
  2. Recursively Enumerable Languages
  3. Recursive Languages
  4. Alternative Turing Machines
  5. Enumeration

Background Material

0. Text: Lecture 28, 29, (scan) 30, 31
1. Wikepedia: Turing
2. Busch, Shiri & Grahne: Introduction to Turing Machines
3. Busch, Shiri & Grahne: Turing's Thesis and Alternative Turing Machines
4. Busch, Shiri & Grahne: Universal Turing Machines and Countable
5. Video of Intro to Turing Machines [vPOD]
6. Video of Alternative Acceptance Criteria [vPOD]
7. Video of Turing Machines that compute [vPOD]
8. Video of Composition of Turing Computable Functions [vPOD]
9. Video of Countable Sets
10. Video of Chomsky Hierarchy

Old Homeworks

Homework Summer 05 [PDF]
Solutions [DOC] [PDF]

Homework

Homework 6 [PDF]

Homework Solutions [PDF]

Turing Machine Simulator