CS 490/Math 485 Theory of Computation

This document contatins:

	General information
	Homework (usually with solutions)
	Tests (with solutions once you've taken them)
	Relevant newsgroups
	Miscellaneous interesting stuff

Please feel free to put any suggestions or comments you might have in the suggestion box.

	Instructor: James A. Foster Office: JEB B24 Phone: 885-7062 Office Hours: MF 4:30-5:20, MW 2:00-3:20 Email: foster@cs.uidaho.edu Text: John C. Martin, Introduction to Languages and the Theory of Computation, McGraw-Hill, 1991
	Objectives To recognize a computation To be able to give a mathematically precise characterization of computation To understand the limitations of various models of computation, which includes realizing that some well-stated problems cannot be solved by any algorithm.
	Activities Lectures The student will be given exercises on a regular basis. These will not be graded homework assignments. However, students are strongly advised to work through all exercise assignments. Take three examinations, including a cumulative final.
	Grading: The first two tests will be 30% of the grade and the final will be 40%. Classroom participation will also be taken into consideration.
	Syllabus: Press here for the course syllabus.

	Homework 1: 3.2,3.6.3.9 b,c,e,h, 3.1
	Homework 2: 4.3, 4.4, 4.5, 4.10, 4.15, 4.17, 4.19
	Homework 3: 5.1, 5.2, 5.4, 5.12, 5.15, 5.17; 6.6, 6.7, 6.8
	Homework 4: 7.10, 7.11, 7.12, 7.14, 8.1, 8.2, 8.4, 8.6
	Homework 5: 9.4b, 9.11 a,c, 9.12 acfi, 9.15, 9.18 1de
	Homework 6: 12.3, 12.5ab, 12.6ab, 12.12; 13.1b; 15.1ac, 15.2ac
	Homework 7: 16.3ae, 16.6a, 16.9ce, 17.1, 17.5, 17.12, (look at 17.9,10)
	Homework 8: 18.3, 18.5, 18.7, 18.12, 20.1, 20.2, 20.4
	Homework 9: 23.2, 23.14, 23.15, 23.16, (try 23.6)
	Homework 10: Practice with oracles and NP

	1994 Test 1
	1994 Test 2
	1992 Midterm Examination
	1992 Final Examination

	uidaho.cs.theory
	comp.theory
	sci.logic