Computability theory : an introduction to recursion theory

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 logi...

Full description

Bibliographic Details
Main Author: Enderton, Herbert B. (Author)
Format: Book
Language:English
Published: Amsterdam, Netherland ; Boston : Academic Press , c2011
Subjects:
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