http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
1 online resource (ix, 409 pages) : illustrations
"Computability Theory presents a comprehensive, highly readable introduction to contemporary computability theory, techniques, and results. The author places the basic concepts and techniques in their historical, philosophical, and logical contexts, and offers an unusual breadth of coverage, including a number of advanced topics not usually addressed in books at this level. The result is an invaluable text, reference, and guide to the direction of current research in the field. The author brings the techniques and results of this beautiful and basic subject alive in an approachable and lively way."--Jacket
pt. I. Computability and Unsolvable Problems -- 1. Hilbert and the Origins of Computability Theory -- 2. Models of Computability and the Church-Turing Thesis -- 3. Language, Proof and Computable Functions -- 4. Coding, Self-Reference and the Universal Turning Machine -- 5. Enumerability and Computability -- 6. The Search for Natural Examples of Incomputable Sets -- 7. Comparing Computability and the Ubiquity of Creative Sets -- 8. Godel's Incompleteness Theorem -- 9. Decidable and Undecidable Theories -- pt. II. Incomputability and Information Content -- 10. Computing with Oracles -- 11. Nondeterminism, Enumerations and Polynomial Bounds -- pt. III. More Advanced Topics -- 12. Post's Problem: Immunity and Priority.
Includes bibliographical references (pages 383-388) and index.