James A. Foster 

CS 590 Theory of Computation: Spring 1995 Instructor: Dr. James A. Foster This course covers the fundamentals of recursive function theory and the theory of computational complexity. That is, we examine the inherent limitations of computation, both theoretical and practical, in some detail. For more details, see the course syllabus. This document contains:
AnnouncementsNone yet! General Information
Homework
There will be no more than 8 homework assignments (one every two weeks). These will be suggested exercises to help you understand definitions and results. I will check your homework to be sure that you are making a goodfaith effort, but will not grade ithence, it does not contribute to your grade. You will understand the material best if you do the homework. I will provide solutions to all homework problems. See the course notes from last year for the homework last year.
TestsHere are some sample tests from previous years.
Relevant Newsgroups

Last Updated 05/30/2003 09:06 0700 
foster@cs.uidaho.edu