| Description |
1 online resource (viii, 174 pages) : illustrations |
|
text txt rdacontent |
|
computer c rdamedia |
|
online resource cr rdacarrier |
| Summary |
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. Frequent historical information presented throughout More extensive motivation for each of the topics than other texts currently available Connects with topics not included in other textbooks, such as complexity theory. |
| Contents |
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. |
| Bibliography |
Includes bibliographical references and index. |
| Contents |
The computability concept -- General recursive functions -- Programs and machines -- Recursive enumerability -- Connections to logic -- Degrees of unsolvability -- Polynomial-time computability -- A1: Mathspeak -- A2: Countability -- A3: Decadic Notation. |
| Note |
Print version record. |
| Subject |
Recursion theory.
|
|
Théorie de la récursivité.
|
|
Recursion theory
|
|
Berechenbarkeit.
|
|
Rekursionsmethode.
|
|
Berechenbarkeit.
|
|
Rekursionstheorie.
|
| Other Form: |
Print version: Enderton, Herbert B. Computability theory. Amsterdam ; Boston : Academic Press, ©2011 9780123849588 (DLC) 2010038448 (OCoLC)641524716 |
| ISBN |
9780123849588 (electronic bk.) |
|
0123849586 (electronic bk.) |
|
9780123849595 |
|
0123849594 |
| Standard No. |
9786612955150 |
|
99941236049 |
|
AU@ 000047499857 |
|
AU@ 000050013233 |
|
CHNEW 001010047 |
|
DEBBG BV039830057 |
|
DEBBG BV040900687 |
|
DEBSZ 337164525 |
|
DEBSZ 378275925 |
|
DEBSZ 381367142 |
|
NZ1 15190049 |
|
DKDLA 820120-katalog:9910110510305765 |
|
