Item Details
Computability Theory
Rebecca Weber
 Format
 Book
 Published
 Providence, R.I. : American Mathematical Society, c2012.
 Language
 English
 Series
 Student Mathematical Library
 ISBN
 9780821873922 (alk. paper), 082187392X (alk. paper)
 Summary
 "What can we computeeven with unlimited resources? Is everything within reach? Or are computations necessarily drastically limited, not just in practice, but theoretically? These questions are at the heart of computability theory. The goal of this book is to give the reader a firm grounding in the fundamentals of computability theory and an overview of currently active areas of research, such as reverse mathematics and algorithmic randomness. Turing machines and partial recursive functions are explored in detail, and vital tools and concepts including coding, uniformity, and diagonalization are described explicitly. From there the material continues with universal machines, the halting problem, parametrization and the recursion theorem, and thence to computability for sets, enumerability, and Turing reduction and degrees. A few more advanced topics round out the book before the chapter on areas of research. The text is designed to be selfcontained, with an entire chapter of preliminary material including relations, recursion, induction, and logical and set notation and operators. That background, along with ample explanation, examples, exercises, and suggestions for further reading, make this book ideal for independent study or courses with few prerequisites." Publisher description.
 Contents
 1. Introduction. Approach ; Some history ; Notes on use of the text ; Acknowledgements and references
 2. Background. Firstorder logic ; Sets ; Relations ; Bijection and isomorphism ; Recursion and introduction ; Some notes on proofs and abstractions
 3. Defining computability. Functions, sets, and sequences ; Turing machines ; Partial recursive functions ; Coding and countability ; A universal Turing machine ; The ChurchTuring thesis ; Other definitions of computability
 4. Working with computable functions. The halting problem ; The "three contradictions" ; Parametrization ; The recursive theorem ; Unsolvability
 5. Computing and enumerating sets. Dovetailing ; Computing and enumerating ; Aside : enumeration and incompleteness ; Enumerating noncomputable sets
 6.Turing reduction and Post's problem. Reducibility of sets ; Finite injury priority arguments ; Notes on approximation
 7. Two hierarchies of sets. Turing degrees and relativization ; The arithmetical hierarchy ; Index sets and arithmetical completeness
 8. Further tools and results. The limit Lemma ; The Arslanov completeness criterion ; ε modulo finite difference
 9. Areas of research. Computably enumerable sets and degrees ; Randomness ; Some model theory ; Computable model theory ; Reverse mathematics
 Appendix A : Mathematical asides. The Greek alphabet ; Summations ; Cantor's cardinality proofs.
 Description
 vii, 203 p. : ill. ; 22 cm.
 Notes
 Includes bibliographical references (p. 193197) and index.
 Series Statement
 Student mathematical library ; v. 62
 Technical Details

 Access in Virgo Classic
 Staff View
LEADER 04341cam a2200589 a 4500001 u6148923003 SIRSI005 20131201140726.0008 120110s2012 riua b 001 0 enga 2011050912a 016108304 2 Uka 9780821873922 (alk. paper)a 082187392X (alk. paper)a AU@ b 000048451723a NZ1 b 14287153a (Sirsi) o772525846a (OCoLC)772525846a DLC b eng c DLC d YDX d BTCTA d YDXCP d BWX d UKMGB d PUL d OCLCO d GJG d ZLM d OCLCF d CDXa pcca QA9.6 b .W43 2012c (Sa 511.3/52 2 23a 03Dxx 2 msca Weber, Rebecca, d 1977a Computability theory / c Rebecca Weber.a Providence, R.I. : b American Mathematical Society, c c2012.a vii, 203 p. : b ill. ; c 22 cm.a Student mathematical library ; v v. 62a Includes bibliographical references (p. 193197) and index.a "What can we computeeven with unlimited resources? Is everything within reach? Or are computations necessarily drastically limited, not just in practice, but theoretically? These questions are at the heart of computability theory. The goal of this book is to give the reader a firm grounding in the fundamentals of computability theory and an overview of currently active areas of research, such as reverse mathematics and algorithmic randomness. Turing machines and partial recursive functions are explored in detail, and vital tools and concepts including coding, uniformity, and diagonalization are described explicitly. From there the material continues with universal machines, the halting problem, parametrization and the recursion theorem, and thence to computability for sets, enumerability, and Turing reduction and degrees. A few more advanced topics round out the book before the chapter on areas of research. The text is designed to be selfcontained, with an entire chapter of preliminary material including relations, recursion, induction, and logical and set notation and operators. That background, along with ample explanation, examples, exercises, and suggestions for further reading, make this book ideal for independent study or courses with few prerequisites." Publisher description.a Recursion theory.a Computable functions.a Student mathematical library ; v v. 62.6 50500/(S a 1. Introduction. Approach ; Some history ; Notes on use of the text ; Acknowledgements and references  2. Background. Firstorder logic ; Sets ; Relations ; Bijection and isomorphism ; Recursion and introduction ; Some notes on proofs and abstractions  3. Defining computability. Functions, sets, and sequences ; Turing machines ; Partial recursive functions ; Coding and countability ; A universal Turing machine ; The ChurchTuring thesis ; Other definitions of computability  4. Working with computable functions. The halting problem ; The "three contradictions" ; Parametrization ; The recursive theorem ; Unsolvability  5. Computing and enumerating sets. Dovetailing ; Computing and enumerating ; Aside : enumeration and incompleteness ; Enumerating noncomputable sets  6.Turing reduction and Post's problem. Reducibility of sets ; Finite injury priority arguments ; Notes on approximation  7. Two hierarchies of sets. Turing degrees and relativization ; The arithmetical hierarchy ; Index sets and arithmetical completeness  8. Further tools and results. The limit Lemma ; The Arslanov completeness criterion ; ε modulo finite difference  9. Areas of research. Computably enumerable sets and degrees ; Randomness ; Some model theory ; Computable model theory ; Reverse mathematics  Appendix A : Mathematical asides. The Greek alphabet ; Summations ; Cantor's cardinality proofs.a 5a QA9.6 .W43 2012 w LC i X031604048 l STACKS m SCIENG t BOOK
Availability
Library  Location  Map  Availability  Call Number 

Brown Science and Engineering  Stacks  N/A  Available 
QA9.6 .W43 2012 