Computability TheoryCRC Press, 6 sept. 2017 - 420 pages 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. |
Table des matières
Incomputability and Information Content | 137 |
More Advanced Topics | 217 |
Further Reading | 383 |
Autres éditions - Tout afficher
Expressions et termes fréquents
1-generic 1-random a₁ algorithm arithmetical hierarchy Assume axiomatisable axioms basic c.e. degrees c.e. sets Church-Turing Thesis comeager complete computability theory computable functions computable relation computably enumerable construction COROLLARY countable Deduce define DEFINITION defn deg(A degree structure dominates e-degree EXAMPLE EXERCISE exists finite function f given gives Gödel numbers Gödel's Gödel's Completeness Theorem Graph(f halting halting problem hence Hint hyperimmune incomputable sets induction infinite information content input isomorphic jump lambda calculus language lattice Lemma linear ordering logic mathematics minimal cover minimal degree notation numbers oracle oracle Turing machine order theory ordinals outcomes p.c. function partial polynomial Post's Theorem primitive recursive primitive recursive functions problem properties prove putable real numbers Recursion Theory recursive functions relativised REMARK restraints result satisfied sequence Show SOLUTION strategy strings subset Theorem tree Turing computable Turing degrees Turing machine unsolvable URM program write σο