Computability Theory: An Introduction To Recursion Theory by Herbert B. EndertonComputability Theory: An Introduction To Recursion Theory by Herbert B. Enderton

Computability Theory: An Introduction To Recursion Theory

byHerbert B. Enderton

Paperback | October 30, 2018

Pricing and Purchase Info

$111.88 online 
$124.31 list price
Earn 559 plum® points

Prices and offers may vary in store

Out of stock online

Not available in stores


Computability Theory: An Introduction to Recursion Theoryprovides 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 Theoryis 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
Title:Computability Theory: An Introduction To Recursion TheoryFormat:PaperbackDimensions:192 pages, 8.75 × 6.35 × 0.68 inPublished:October 30, 2018Publisher:Academic PressLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:0128101857

ISBN - 13:9780128101858


Table of 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;