Theory of Computation
CS544 (201)


Technical Books

Hopcroft, Motwani, Ullman is an updated version of the classical Hopcroft, Ullman text on automata theory. Presentation is much improved. Odifreddi's book covers computability theory (decidability) emphasizing the philosophical and scientific context. Garey, Johnson is the standard guide to NP-completeness theory.

Background and History

Fiction and popular accounts

Marcus Schaefer
Last updated: January 15, 2001.