Faithful Prof: Jeff  Edmonds    jeff@cse.yorku.ca    Office Hours
Lectures: Mon-Wed 11:30-1:00 CB 122
Home Work and Test Dates     Your Marks (4111,5111)
     Weds 1:00-3 (SC 222)
     Jan 21, Feb 4, Feb 25, Mar 11, Mar 25
4111 Forum    Photos     Class

TEXTS:

Course Description
Course Syllabus
Steve Cook: Computability and Recursive and Recursively Enumerable Sets
Russell Impagliazzo Notes
Jeff Edmonds' "How to Think about Algorithms"   Amazon   Cambridge House Press   Desk Copies   reviews
Michael Sipser, Introduction to the Theory of Computation, (second edition) PWS Publishing Company, 2006.
Lewis and Papadimitriou, Elements of the Theory of Computation (second edition) 1998.
Hopcroft, J.E. and Ullman, J.D., Introduction to Automata, Languages and Programming, Addison Wesley, 1979.
Gems of Theoretical Computer Science (Many thanks to U. Schoning and R. Pruim)
Other References

GRADING:

Assignments: 0%
5 Unit Tests (T_i): Worth between 4%*5=20% and 11%*5=55%  
Class Participation (P): Worth between 2% and 10%  
Exam: Worth between 35% and 78%
Final Mark   = Σ_i=1..5 [ 0.04 T_i + 0.07 Max(T_i,E) ] + [ 0.02 P + 0.08 Max(P,E) ] + 0.35 E
        Example
Your Marks (4111,5111)

IMPORTANT DATES :