Advertisement

© 2016

Turing Computability

Theory and Applications

Textbook

Part of the Theory and Applications of Computability book series (THEOAPPLCOM)

Table of contents

  1. Front Matter
    Pages i-xxxvi
  2. Foundations of Computability

    1. Front Matter
      Pages 1-1
    2. Robert I. Soare
      Pages 3-22
    3. Robert I. Soare
      Pages 23-50
    4. Robert I. Soare
      Pages 51-78
    5. Robert I. Soare
      Pages 79-105
    6. Robert I. Soare
      Pages 107-129
    7. Robert I. Soare
      Pages 131-146
    8. Robert I. Soare
      Pages 147-162
  3. Trees and $$\Pi_1^0$$ Classes

    1. Front Matter
      Pages 163-163
    2. Robert I. Soare
      Pages 165-173
    3. Robert I. Soare
      Pages 175-182
    4. Robert I. Soare
      Pages 183-187
    5. Robert I. Soare
      Pages 189-194
  4. Minimal Degrees

    1. Front Matter
      Pages 195-195
    2. Robert I. Soare
      Pages 203-208
  5. Games in Computability Theory

    1. Front Matter
      Pages 209-209
    2. Robert I. Soare
      Pages 211-216
    3. Robert I. Soare
      Pages 217-219

About this book

Introduction

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 is a leading authority on the topic and he has taught the subject using the book content over decades, honing it according to experience and 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.

Keywords

Alan Turing Computability theory Computably enumerable (C.E.) sets Turing reducibility Finite injury method Oracle constructions Tree method Minimal degrees Games in computability theory Relative computability Peano arithmetic

Authors and affiliations

  1. 1.Department of MathematicsThe University of ChicagoChicagoUSA

About the authors

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 primary reference on computability theory for students and researchers: Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Springer, 1987). He is the author of numerous papers on computability theory and mathematical logic. His 1974 Annals of Mathematics paper on automorphisms of computably enumerable sets was selected in the 2003 book by Gerald Sacks as one of the most important in mathematical logic in the twentieth century. He has been an invited speaker at the International Congress of Mathematicians, and a plenary speaker at the International Congress of Logic, Methodology, and Philosophy of Science, the Association of Symbolic Logic Centennial in 2000, the British Mathematical Colloquium in 2012, the Royal Society Meeting on the Incomputable in 2012, and Computability in Europe (CiE) in 2007 and 2012.  He was the winner of the 2011 University of Chicago Award for Excellence in Graduate Teaching and is a Fellow of the American Mathematical Society.

Bibliographic information

  • Book Title Turing Computability
  • Book Subtitle Theory and Applications
  • Authors Robert I. Soare
  • Series Title Theory and Applications of Computability
  • Series Abbreviated Title Theory Applications Computability
  • DOI https://doi.org/10.1007/978-3-642-31933-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 2016
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science Computer Science (R0)
  • Hardcover ISBN 978-3-642-31932-7
  • Softcover ISBN 978-3-662-56858-3
  • eBook ISBN 978-3-642-31933-4
  • Series ISSN 2190-619X
  • Series E-ISSN 2190-6203
  • Edition Number 1
  • Number of Pages XXXVI, 263
  • Number of Illustrations 4 b/w illustrations, 0 illustrations in colour
  • Topics Theory of Computation
    Mathematics of Computing
    Mathematical Logic and Foundations
  • Buy this book on publisher's site
Industry Sectors
Automotive
Biotechnology
IT & Software
Telecommunications
Consumer Packaged Goods
Aerospace
Engineering
Finance, Business & Banking
Electronics

Reviews

“At a time when computability theory is enjoying remarkable activity and fruitfulness, and benefiting from having a large number of students and young researchers, there is no question that the subject is ready for a new standard introductory text. The present book shares all the features that helped its predecessor become such a standard thirty years ago, and at the same time, it is modern, and it is relevant to today’s state of the field. The subject will be well-served by it.” (Damir D. Dzhafarov, Bulletin of Symbolic Logic, Vol. 23 (1), March, 2017)