
Computability Theory
S. Barry Cooper(Author)
Chapman & Hall/CRC (Publisher)
1st Edition
Published on 17. November 2003
Book
Hardback
420 pages
978-1-58488-237-4 (ISBN)
Shipment within 15-20 days
Description
Computability theory originated with the seminal work of Goedel, 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.
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.
Reviews / Votes
"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
More details
Series
Language
English
Place of publication
Oxford
United States
Publishing group
Taylor & Francis Inc
Target group
College/higher education
Professional and scholarly
Undergraduate
Illustrations
35 s/w Abbildungen
35 Illustrations, black and white
Dimensions
Height: 240 mm
Width: 161 mm
Thickness: 27 mm
Weight
793 gr
ISBN-13
978-1-58488-237-4 (9781584882374)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions
S. Barry Cooper
Computability Theory, Second Edition
Book
06/2017
2nd Edition
Chapman & Hall/CRC
€43.32
The article will not be published
Additional editions


Person
Cooper, S. Barry; Cooper, S. Barry
Content
COMPUTABILITY, AND UNSOLVABLE PROBLEMS: Hilbert and the Origins of Computability Theory. Models of Computability and the Church-Turing Thesis. Language, Proof and Computable Functions. Coding, Self-Reference and Diagonalisation. Enumerability and Computability. The Search for Natural Examples of Incomputable Sets. Comparing Computability. Goedel's Incompleteness Theorem. Decidable and Undecidable Theories. INCOMPUTABILITY AND INFORMATION CONTENT: Computing with Oracles. Nondeterminism, Enumerations and Polynomial Bounds. MORE ADVANCED TOPICS: Post's Problem: Immunity and Priority. The Computability of Theories. Forcing and Category. Applications of Determinacy. Computability and Structure.