Full Description
Intended for use in an introductory graduate course in theoretical computer science, this text contains material that should be core knowledge in the theory of computation for all graduates in computer science. It is self-contained and is best suited for a one semester course. The text starts with classical computability theory which forms the basis for complexity theory. This has the pedagogical advantage that students learn a qualitative subject before advancing to a quantitative one. Since this is a graduate course, students should have some knowledge of such topics as automata theory, formal languages, computability theory, or complexity theory.
Contents
1. Preliminaries; 2. Introduction to Computability; 3. Undecidability; 4. Introduction to Complexity Theory; 5. Basic Results; 6. Nondeterminism and NP-Completeness; 7. Relative Computability
