Designed for advanced undergraduate or beginning graduate students, this book provides a complete introduction to computability theory. This second edition includes new material on hyperarithmetical and Borel sets as well as more material on computability of structures, Pi-0-1 classes, and computability in science. It features an expanded treatment of complexity of computations and updated future directions in computability. In addition, the section on randomness is now a separate chapter. The author also discusses advanced topics in greater depth, including Post's problem, forcing and category, applications of determinacy, and the computability of theories.
Reihe
Auflage
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
Undergraduate
Illustrationen
50 s/w Abbildungen
50 Illustrations, black and white
Maße
Höhe: 234 mm
Breite: 156 mm
ISBN-13
978-1-4398-3843-3 (9781439838433)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
S. Barry Cooper is a professor in the Department of Pure Mathematics at the University of Leeds, UK.
Computability and Unsolvable Problems. Incomputability and Information Content. More Advanced Topics.
