Turing Computability: Theory And Applications by Robert I. SoareTuring Computability: Theory And Applications by Robert I. Soare

Turing Computability: Theory And Applications

byRobert I. Soare

Hardcover | June 28, 2016

Pricing and Purchase Info


Earn 588 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This model led to both the development of actual computers and to computability theory, the study of what machines can and cannot compute. This book presents classical computability theory from Turing and Post to current results and methods, and their use in studying the information content of algebraic structures, models, and their relation to Peano arithmetic. The author presents the subject as an art to be practiced, and an art in the aesthetic sense of inherent beauty which all mathematicians recognize in their subject. 

Part I gives a thorough development of the foundations of computability, from the definition of Turing machines up to finite injury priority arguments. Key topics include relative computability, and computably enumerable sets, those which can be effectively listed but not necessarily effectively decided, such as the theorems of Peano arithmetic. Part II includes the study of computably open and closed sets of reals and basis and nonbasis theorems for effectively closed sets. Part III covers minimal Turing degrees. Part IV is an introduction to games and their use in proving theorems. Finally, Part V offers a short history of computability theory.

The author has honed the content over decades according to feedback from students, lecturers, and researchers around the world. Most chapters include exercises, and the material is carefully structured according to importance and difficulty. The book is suitable for advanced undergraduate and graduate students in computer science and mathematics and researchers engaged with computability and mathematical logic.

Robert Soare is the Paul Snowden Russell Distinguished Service Professor Emeritus of Mathematics and Computer Science at the University of Chicago. He was the founding chairman of the Department of Computer Science in 1983. He has supervised the dissertations of nineteen Ph.D. students using the content of this book. He wrote the prima...
Title:Turing Computability: Theory And ApplicationsFormat:HardcoverDimensions:263 pagesPublished:June 28, 2016Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3642319327

ISBN - 13:9783642319327

Look for similar items by category:


Table of Contents

Part I Foundations of Computability.- Chap. 1 Defining Computability.- Chap. 2 Computably Enumerable Sets.- Chap. 3 Turing Reducibility.- Chap. 4 The Arithmetical Hierarchy.- Chap. 5 Classifying C.E. Sets.- Chap. 6 Oracle Constructions and Forcing.- Chap. 7 The Finite Injury Method.- Part II Trees and Î 01 Classes.- Chap. 8 Open and Closed Classes.- Chap. 9 Basis Theorems.- Chap. 10 Peano Arithmetic and Î 01-Classes.- Chap. 11 Randomness and Î 01-Classes.- Part III Minimal Degrees.- Chap. 12 Minimal Degrees Below Øʹʹ.- Chap. 13 Minimal Degrees Below Øʹ.- Part IV Games in Computability Theory.- Chap. 14 Banach-Mazur Games.- Chap. 15 Gale-Stewart Games.- Chap. 16 More Lachlan Games.- Part V History of Computability.- Chap. 17 History of Computability.- References.- Index.