Computability and Complexity
Recursive and Recursively Enumerable Sets
Jeff Edmonds' "How to Think about Algorithms"
Cambridge House Press
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)
5 Unit Tests (Ti): Worth between 4%*5=20% and 11%*5=55%
Class Participation (P): Worth between 2% and 10%
Exam: Worth between 35% and 78%
0.04 Ti + 0.07 Max(Ti,E)
] + [
0.02 P + 0.08 Max(P,E)