Scribd
Upload
128 views3 pages

Computability. Turing, Gödel, Church, and Beyond - 00 - 02

This book discusses the concept of computability through the works of Turing, Gödel, Church and others. It covers topics like computability over real numbers, the relationship between computability and Gödel's incompleteness theorems, and interactive computing. The book has chapters from multiple authors and aims to explore computability from mathematical, philosophical and computational complexity perspectives.

Uploaded by

Dimas Cabré i Chacón
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
128 views3 pages

Computability. Turing, Gödel, Church, and Beyond - 00 - 02

This book discusses the concept of computability through the works of Turing, Gödel, Church and others. It covers topics like computability over real numbers, the relationship between computability and Gödel's incompleteness theorems, and interactive computing. The book has chapters from multiple authors and aims to explore computability from mathematical, philosophical and computational complexity perspectives.

Uploaded by

Dimas Cabré i Chacón
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Computability

B. Jack Copeland, Carl J. Posy, Oron Shagrir

Published by The MIT Press

Copeland, B. Jack, et al.


Computability: Turing, Gödel, Church, and Beyond.
The MIT Press, 2013.
Project MUSE.muse.jhu.edu/book/39754.

For additional information about this book


https://muse.jhu.edu/book/39754

[ This content has been declared free to read by the pubisher during the COVID-19 pandemic. ]
Contents

Introduction: The 1930s Revolution vii

1 Turing versus Gödel on Computability and the Mind 1


B. Jack Copeland and Oron Shagrir
2 Computability and Arithmetic 35
Martin Davis
3 About and around Computing over the Reals 55
Solomon Feferman
4 The Church-Turing “Thesis” as a Special Corollary
of Gödel’s Completeness Theorem 77
Saul A. Kripke
5 Computability and Constructibility 105
Carl J. Posy
6 After Gödel 141
Hilary Putnam
7 The Open Texture of Computability 153
Stewart Shapiro
8 Gödel’s Philosophical Challenge (to Turing) 183
Wilfried Sieg
9 Interactive Computing and Relativized Computability 203
Robert Irving Soare
10 Why Philosophers Should Care about Computational Complexity 261
Scott Aaronson
vi Contents

11 Is Quantum Mechanics Falsifiable? A Computational Perspective on


the Foundations of Quantum Mechanics 329
Dorit Aharonov and Umesh V. Vazirani

About the Authors 351


Index 355

You might also like