Computability Turing, Gödel, Church, and beyond

Saved in:
Bibliographic Details
Format Electronic eBook
LanguageEnglish
Published Cambridge, Massachusetts : The MIT Press, [2013]
Subjects
Computational complexity.
Mathematics > Philosophy.
elektronické knihy
electronic books
Online AccessFull text
ISBN9780262312677
Physical Description1 online zdroj (pages cm.)

Cover

Table of Contents:
  • 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čodel's completeness theorem / Saul A. Kripke
  • Computability and constructibility / Carl J. Posy
  • After Gčodel / Hilary Putnam
  • The open texture of computability / Stewart Shapiro
  • Gčodel'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.

Similar Items