?01 Class
A01=S. Barry Cooper
advanced computability applications
Arithmetical Hierarchy
Arithmetical Sets
Author_S. Barry Cooper
automorphism groups
Axiomatic Theories
Borel sets
Category=UYA
Church Turing Thesis
computability theory
Computable Functions
Computable Ordinals
Computable Relation
Computable Sets
Creative Sets
degree structures
determinacy
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Fixed Point Theorem
Halting Problem
incomputable sets
Julia Sets
Lambda Calculus
LPA
mathematical logic
Nonstandard Model
Oracle Turing Machine
Partial Recursive Functions
Post's problem
Post’s problem
Primitive Recursion
Primitive Recursive Functions
priority methods
randomness
recursion theory
subrecursive hierarchy
Turing Computable Functions
Turing Degrees
turing machine
Turing Programs
Universal Turing Machine
Π01 Class
Product details
- ISBN 9781584882374
- Weight: 716g
- Dimensions: 156 x 234mm
- Publication Date: 17 Nov 2003
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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.
Cooper, S. Barry; Cooper, S. Barry
