"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretic

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.

This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the study of t

Computability and complexity theory should be of central concern to practitioners as well as theorists. Unfortunately, however, the field is known for its impen

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. Additions to the second ed