CS5000: Computability Theory

Vladimir A. Kulyukin
Department of Computer Science
Utah State University
vladimir.kulyukin@usu.edu

Syllabus

Announcements

• The midterm exam will be on October 22, 2008.
• The final exam will be on December 8, 2008, 9:30am to 11:20am.

Lectures

• Lecture 1
• Lecture 2
• Lecture 3
• Lecture 4
• Lecture 5
• Lecture 6
• Lecture 7
• Lecture 8
• Lecture 9
• Lecture 10
• Lecture 11
• Lecture 12
• Lecture 13
• Lecture 14
• Lecture 15
• Lecture 16
• Lecture 17
• Lecture 18
• Lecture 19
• Lecture 20
• Lecture 21
• Lecture 22
• Lecture 23
• Midterm Practice Problems
• Lecture 24
• Lecture 25: Midterm Exam
• Lecture 26
• Lecture 27: Discussion of Midterm Results
• Lecture 28
• Lecture 29
• Lecture 30
• Lecture 31
• Lecture 32 There was a typo in Slide 20 which is now corrected. One of the lines on the slide used to read c = #(X) = 1. It should read c = (X) - 1 = 1. Thanks to Santhi Kollipara for pointing it out to me.
• Lecture 33
• Lecture 34
• Lecture 35
• Lecture 36
• Lecture 37
• Lecture 38
• Lecture 39
• Lecture 40

Assignments

• Assignment 1
• Assignment 2 Problem 3 of Assignment 2 should read "Give regular expressions for the following regular languages."
• Assignment 3
• Assignment 4
• Assignment 5
• Assignment 6
• Assignment 7
• Assignment 8
• Assignment 9
• Assignment 10
• Assignment 11