Computability Theory
An Introduction to Recursion Theory
Seiten
2010
Academic Press Inc (Verlag)
978-0-12-384958-8 (ISBN)
Academic Press Inc (Verlag)
978-0-12-384958-8 (ISBN)
Provides an introduction to contemporary computability theory, techniques, and results. This title includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy.
Computability Theory: An Introduction to Recursion 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 text 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 way.
Computability Theory: An Introduction to Recursion 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 text 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 way.
1. The Computability Concept;2. General Recursive Functions;3. Programs and Machines;4. Recursive Enumerability;5. Connections to Logic;6. Degrees of Unsolvability;7. Polynomial-Time Computability;Appendix: Mathspeak;Appendix: Countability;Appendix: Decadic Notation;
| Verlagsort | San Diego |
|---|---|
| Sprache | englisch |
| Maße | 152 x 229 mm |
| Gewicht | 460 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre |
| ISBN-10 | 0-12-384958-6 / 0123849586 |
| ISBN-13 | 978-0-12-384958-8 / 9780123849588 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2024)
World Scientific Publishing Co Pte Ltd (Verlag)
CHF 43,60
what we have that machines don't
Buch | Softcover (2024)
Profile Books Ltd (Verlag)
CHF 19,15
how simple questions lead us to mathematics’ deepest truths
Buch | Softcover (2024)
Profile Books Ltd (Verlag)
CHF 19,15
