Turing Machine image, taken from WorldOfComputing.net

Course Schedule

Week 1 To Do:
  • Read Chapters 1 and 2
Lecture 1:
  • Discuss course expectations and main goals
Lecture 2:
  • Types of programs
Lecture 3:
  • An example of undecidability
Week 2 To Do:
  • Read Chapters 3 and 4
Lecture 1:
  • No class
Lecture 2:
  • What is a problem?
Lecture 3:
  • What does it mean to be computable?
Week 3 To Do:
  • Read Chapter 5
Lecture 1:
  • What is a language?
Lecture 2:
  • No class
Lecture 3:
Week 4 To Do:
Lecture 1:
  • Introduction to Turing Machines
Lecture 2:
  • More fun with TMs
Lecture 3:
  • TM Review; Quiz 01
Week 5 To Do:
Lecture 1:
  • Turing equivalence
Lecture 2:
Lecture 3:
  • Lambda Calculus; Church Numerals
Week 6 To Do:
Lecture 1:
  • Church encodings
Lecture 2:
Lecture 3:
  • Quiz 2

Resources