Computability theory : an introduction to recursion theory /

Show other versions (1)

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
Call Number:Libro Electrónico
Main Author: Enderton, Herbert B.
Format: Electronic eBook
Language:Inglés
Published: Amsterdam ; Boston : Academic Press, ©2011.
Subjects:
Recursion theory.
Théorie de la récursivité.
Recursion theory
Berechenbarkeit.
Rekursionsmethode.
Rekursionstheorie.
Online Access:Texto completo (Requiere registro previo con correo institucional)
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.
  • 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.

Similar Items