James A. Foster

Home Up Next

CS 490/Math 485 Theory of Computation

Fall 1994

The theory of computation investigates the nature of computation, apart from any particular computing devices or programming languages. It develops mathematical models of computation and uses these to investigate and characterize the inherent limiations of computing.

This document contatins:
bullet General information
bullet Homework (usually with solutions)
bullet Tests (with solutions once you've taken them)
bullet Relevant newsgroups
bullet Miscellaneous interesting stuff
Please feel free to put any suggestions or comments you might have in the suggestion box.

General Information

bullet Instructor: James A. Foster
bullet Office: JEB B24
bullet Phone: 885-7062
bullet Office Hours: MF 4:30-5:20, MW 2:00-3:20
bullet Email: foster@cs.uidaho.edu
bullet Text: John C. Martin, Introduction to Languages and the Theory of Computation, McGraw-Hill, 1991

bullet Objectives
bullet To recognize a computation
bullet To be able to give a mathematically precise characterization of computation
bullet To understand the limitations of various models of computation, which includes realizing that some well-stated problems cannot be solved by any algorithm.

bullet Activities
bullet Lectures
bullet 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.
bullet Take three examinations, including a cumulative final.

bullet 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.

bullet Syllabus: Press here for the course syllabus.

Homework

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

Tests

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

Relevent Newsroups

bullet uidaho.cs.theory
bullet comp.theory
bullet sci.logic

Other Stuff of Interest

Check out FLAP, which is in /usr/public/bin. This is an animation program for finite automata. It will help explain the material in this course, and will help with ``homework'' assignments!

foster@cs.uidaho.edu

Last Updated 01/13/2003 15:56 -0800