Computability Theory (Chapman Hall/CRC Mathematics Series) - Hardcover

Cooper, S. Barry

Hardcover

ISBN 10: 1584882379 ISBN 13: 9781584882374

Publisher: Routledge, 2003

Synopsis

Computability theory originated with the seminal work of Gödel, Church, Turing, Kleene and Post in the 1930s. This theory includes a wide spectrum of topics, such as the theory of reducibilities and their degree structures, computably enumerable sets and their automorphisms, and subrecursive hierarchy classifications. Recent work in computability theory has focused on Turing definability and promises to have far-reaching mathematical, scientific, and philosophical consequences.

Written by a leading researcher, Computability Theory provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level.

The book includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science.

Computability Theory is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable and lively way.

About this title

About the Author:

S. Barry Cooper is a professor in the Department of Pure Mathematics at the University of Leeds, UK.

Review:

"A very nice volume indeed. Although primarily a textbook, it lives up to the author's aim to have 'plenty here to interest and inform everyone, from the beginner to the expert.' Cooper writes in an informal style, emphasizing the ideas underlying the techniques. All the standard topics and classic results are here. Students will find useful pointers to the literature and an abundance of exercises woven into the text." - Zentralblatt MATH, 1041 "[It] provides not only a reference repository of well-crafted proofs or proof-outlines for a large number of basic and beyond-basic facts in several areas of computability theory, but can also serve well as the textual basis for a course on the subject" - Mathematical Reviews, 2005h

About this edition

• Publisher: Routledge
• Publication date: 2003
• ISBN 10: 1584882379
• ISBN 13: 9781584882374
• Binding: Hardcover
• Edition number: 1
• Number of pages: 424