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 contatins:
Homework 6 is due lecture 48, 11 May 1995. The lecture numbers were incorrect on the original syllabus. Correct syllabi are now available in the course syllabus or the course FTP site. General Information

foster@cs.uidaho.edu