Computability : Turing, Gödel, Church, and beyond /

Mostrar otras versiones (2)

"In the 1930s a series of seminal works published by Alan Turing, Kurt Gödel, Alonzo Church, and others established the theoretical basis for computability. This work, advancing precise characterizations of effective, algorithmic computability, was the culmination of intensive investigations i...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Otros Autores: Copeland, B. Jack, 1950- (Editor ), Posy, Carl J. (Editor ), Shagrir, Oron, 1961- (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cambridge, Massachusetts : The MIT Press, [2013]
Temas:
Computational complexity.
Mathematics > Philosophy.
Complexité de calcul (Informatique)
Mathématiques > Philosophie.
COMPUTERS > Machine Theory.
Computational complexity
Mathematics > Philosophy
COMPUTER SCIENCE/General
MATHEMATICS & STATISTICS/General
PHILOSOPHY/General
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Turing versus Gödel on computability and the mind / B. Jack Copeland and Oron Shagrir
  • Computability and arithmetic / Martin Davis
  • About and around Computing over the reals / Solomon Feferman
  • The Church-Turing "thesis" as a special corollary of Gödel's completeness theorem / Saul A. Kripke
  • Computability and constructibility / Carl J. Posy
  • After Gödel / Hilary Putnam
  • The open texture of computability / Stewart Shapiro
  • Gödel's philosophical challenge (to Turing) / Wilfried Sieg
  • Interactive computing and relativized computability / Robert Irving Soare
  • Why philosophers should care about computational complexity / Scott Aaronson
  • Is quantum mechanics falsifiable? A computational perspective on the foundations of quantum mechanics / Dorit Aharonov and Umesh V. Vazirani.

Ejemplares similares