James A. Foster

Back Home Up Next

CS 590: Theory of Computation: Spring 1995


Computer Science Home Page Univ. of Idaho Home Page

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:
bullet Announcements
bullet General information
bullet Homework (usually with solutions)
bullet Tests (with solutions once you've taken them)
bullet Relevant newsgroups
bullet Course FTP Site
Please drop any suggestions or comments into the suggestion box.

Announcements

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

bullet Instructor: James A. Foster
bullet Office: JEB B24
bullet Phone: 885-7062
bullet Office Hours: 11:30-12:20 TTh, 4:30-5:20 T
bullet Email: foster@cs.uidaho.edu
bullet Texts
bullet Structural Complexity I, Balcazar, Diaz, and Gabarro. Springer Verlag, 1988.
bullet Computability: An Introduction to Recusive Function Theory, Cutland. Cambridge, 1980.

Homework

  1. Homework 1
  2. Homework 2
  3. Homework 3
  4. Homework 4
  5. Homework 5
  6. Homework 6

See also the course notes from last year for the homework last year.

Tests

Here are some sample tests from previous years.
bullet 1993 Midterm
bullet 1993 Final
bullet Sample test questions for the 1994 Midterm
bullet 1994 Midterm
bullet 1994 Final

Relevant Newsgroups
bullet uidaho.cs.theory for discussion of theoretical CS at UI
bullet comp.theory for discussion of theretical CS world-wide
bullet sci.logic for discussions about logic and computing

Course FTP Site

The ftp site for this course is: ftp.cs.uidaho.edu, using the /pub/cs590/ directory.

Last Updated 05/30/2003 09:06 -0700

foster@cs.uidaho.edu