Teachers can get access to the Solution Manual. Please drop us a note.
Courses that are or have been using The Nature of Computation,
either as the main text or as recommended reading:
- Automata, Computability, and Complexity
- Scott Aaronson, MIT
- Philosophy of Computation
- Walter Dean, U. Warwick
- Algorismia
- Josep Diaz, Universitat Politecnica de Catalunya Barcelona
- Theory
of Computation
- Cris Moore, UNM
- Theoretical
Computer Science
- Bernard Moret, EPFL
- Stochastic Processes: Random and Quasirandom Simulation
- James Propp, U. Mass Lowell
- Markov Chain Monte Carlo Algorithms
- Dana Randall, Georgia Tech.
- Introduction to the Theory of Computation
- Alex Russell, U. Connecticut
- Theory of
Computation
- Denis Thérien, McGill
Please drop us a note if you are using our book for your course.
The Nature of Computation only glancingly treats automata, languages, and grammars because we wanted to focus on more modern aspects of computational complexity. But we understand that many introductory courses include them. If you want to include them feel free to us Cris' lecture notes on automata,languages, and grammars.
|