Prerequisites: CS235
Course Description: Introduction to Computational Theory. This course studies fundamental limits and complexity of computation. Coverage includes formal languages, finite automata, pushdown automata, Turing machines, primitive and partial recursive functions, complexity, and NP-completeness.
Text: Theory of Computation: Formal Languages, Automata, and Complexity, J. Glenn Brookshear. We will cover all of the text. The order of reading is on the Class Schedule and the assigned sections must be read before the class lecture. The lecture will cover topics from the reading where additional help, emphasis, and extensions beyond the text are deemed valuable. Time will not always allow complete coverage of all aspects of the reading, but you are still expected to read and understand the text. You will be responsible for all text information, except where specifically noted, on examinations. To help motivate reading I will pass around a sheet each day for you to mark whether you have done a complete and careful reading, a partial reading, or no reading. A complete and careful reading counts for 2 points, partial - 1 point, none - 0 points. Each day you will mark if you have done the reading for the lecture to be given that day. The grading will be non-linear such that missing one or two readings does not hurt much, but it picks up fast after that.
Homework: Homework will be assigned with each lecture. Homework questions will come from the text and will be due at the beginning of the following class period. It is very important that you keep up with your homework. If you pay the price here you will do well in the class in terms of understanding and examinations.
Examinations: There will be a midterm and a final exam. The problems will be similar in style and difficulty to those found in the homework. The final is comprehensive with emphasis on topics not covered on the midterm.
Lateness: Homework gets 10% off if it is not handed in at class time and loses another 5% for each day late thereafter. There are no free late days. However, if you have a good reason for lateness (sickness, etc., something unique from the typical problems of the rest of your fellow students) then you will receive no late penalty. Just come see the TA about it. Please hand in late homework to the TA. Nothing will be accepted after the last day of this class.
Grading: Grading will be on a curve. Approximate breakdown is Reading (10%), Midterm (28%), Final (32%), Homework (30%).
If you have a question or concern regarding class topics or the grading of your homework or examinations, first talk with the TA. If your concern is about grading take a moment to think out the problem first and have a good argument for your appeal. If you still feel that justice has not been done after working with the TA, come see me.
ENJOY!