Turing Computability by Robert I Soare

Regular price
Checking stock...
Regular price
Checking stock...
Summary

Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. 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 feel-good place to buy books
  • Free delivery in Australia
  • Supporting authors with AuthorSHARE
  • 100% recyclable packaging
  • Proud to be a B Corp – A Business for good

Turing Computability by Robert I Soare

Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. 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.
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 textThe 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)

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.

SKU Unavailable
ISBN 13 9783642319327
ISBN 10 3642319327
Title Turing Computability
Author Robert I Soare
Series Theory And Applications Of Computability
Condition Unavailable
Binding Type Hardback
Publisher Springer
Year published 2016-06-28
Number of pages 263
Cover note Book picture is for illustrative purposes only, actual binding, cover or edition may vary.