James A. Foster 

CS 590 Theory of Computation: Spring 1997 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. We also discuss recent topics in theoretical computer science. For more details, see the course syllabus (also available in postscript). This document contains:
AnnouncementsHere are the slides from my quantum computing lecture slides (sorry, postscript only). Here are the slides from my DNA computing lecture slides (sorry, postscript only). I have written up some more examples of how to use the RiceShapiro theorem to prove a set nonr.e. I have mailed the video students physical copies. These notes are available in postscript form, too. Jackie Shoaf found a really cool link about Ackerman's function. Check it out! Just for grins, I implemented the "big squish", gamma, and gammainverse in perl and put them on the webpage. Recall that these are the functions to encode a vector of naturals as a natural, encode a URM program as a natural, and decode a natural into a URM program. Also, I used the squish function < x,y > = Sum_{i=1}^{x+y}+x. Error checking is very, very minimal in this code, and I don't pretend that it's pretty! But it was interesting. Many of you are taking this course on videotape from Engineering Video Outreach. You will definitely want to check this webpage frequently for changes. Remember, the oncampus class is about a week and a half ahead of you, so information will show up here before anything gets to you in the mail. Also, you will often find relevant materials on the course ftp site. Please use the course newsgroup when possible, so that other students can benefit from your questions and answers. Also, the instructor is easiest to ready by email. General Information
Homework
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.
TestsTests for this year
Sample Tests from Previous Years
There will be two optional final examinations. I will substitute your grade for an optional examination for the corresponding earlier exam, if you tell me to. Here is the cover sheet which I will include with the optional finals, which explains the details (in postscript). Relevant Newsgroups

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