The course:APM 581, Theory of Computation, deals with what can and cannot be computed, andhow efficiently such computations can be done. In particular, we will study models of computation, suchas finite state automata and Turing machines, “languages” (which provide a convenient way to talk aboutcomputational problems), and various “complexity classes” of computational problems, such asP,NP,PSPACE, andBPP. The subject matter of computational complexity is only about 40 years old. It is anexciting and active field of research, with many of the best computer scientists from government, academia,and industry engaged in it, and progress is being made every year.Instructor:Professor Jerrold W. Grossman, 346 SEB, (248) 370-3443.My preferred e-mail address is[email protected]. Rather than listing set office hours, my policy is that I’m almost always aroundand you are encouraged to come for help or just to chat at any time.Of course you can also make anappointment or communicate via phone or e-mail.
This is the end of the preview.
access the rest of the document.
Computational complexity theory, Cambridge University Press, Computational Complexity