Welcome to the home page for the Computer Science Department's Theory of Computation course CLA CS 332. This is the starting point for online course information and documentation.
Please consult the syllabus for the details of the course, grading and other course information.
The Teaching Assistant this semester is Ilir Capuni.
His office hours are Monday, 1:30 - 3:00pm and Wednesdays, 12:00-1:30pm in room PSY 225, his office phone is 358 1121.
The two sections for the course are:
M 12-1 in MCS B33
W 10-11 in MCS B19
The midterm exam is next Tuesday, February 28, in class.
Here is the most recent CS 332 Course News.
Here is the current homework: HW7
Here are the previous homeworks: HW1,
HW2, HW3, HW4, HW5,
and the handout for HW6.
Here are some brief answers to some of the problems in HW1, HW2, HW3, HW4, HW5, HW6.
There was a request for the
average scores on the homeworks and midterm.
Here you can find Alan Turing's 1937 paper where Turing machines were first defined.
Here is an overview of course policy.
CS 332 is the main undergraduate course in computability theory and complexity within the computer science curriculum. Students will learn about Turing machines, universal computation, Church's thesis, decidability, reductions, a variety of unsolvable problems, resource bounded complexity, and common complexity classes.
The following list of pointers provides access to information concerning the course.
Page prepared by Steve Homer