Computability theory : an introduction to recursion theory /

Mostrar otras versiones (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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Enderton, Herbert B.
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Amsterdam ; Boston : Academic Press, ©2011.
Temas:
Recursion theory.
Théorie de la récursivité.
Recursion theory
Berechenbarkeit.
Rekursionsmethode.
Rekursionstheorie.
Acceso en línea:Texto completo (Requiere registro previo con correo institucional)
Tabla de Contenidos:
  • 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.

Ejemplares similares