Computability : Turing, Gödel, Church, and beyond / edited by Jack Copeland, Carl Posy, and Oron Shagrir.

Contributor(s):

Material type: Text

TextPublication details: Cambridge, Massachusetts : The MIT Press, [2013]Description: 1 online resourceContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9781461931843
1461931843
0262312670
9780262312677
9780262312660
0262312662
1299688004
9781299688001
9780262312684
0262312689
9780262527484
0262527480

Subject(s):

Genre/Form:

Electronic books.

Additional physical formats: Print version:: Computability.DDC classification:

511.3/52 23

LOC classification:

QA267.7 .C677 2013eb

Online resources:

Click here to access online

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ö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.

Abstract: "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 into the foundations of mathematics. In the decades since, the theory of computability has moved to the center of discussions in philosophy, computer science, and cognitive science. In this volume, distinguished computer scientists, mathematicians, logicians, and philosophers consider the conceptual foundations of computability in light of our modern understanding. Some chapters focus on the pioneering work by Turing, Gödel, and Church, including the Church-Turing thesis and Gödel's response to Church's and Turing's proposals. Other chapters cover more recent technical developments, including computability over the reals, Gödel's influence on mathematical logic and on recursion theory and the impact of work by Turing and Emil Post on our theoretical understanding of online and interactive computing; and others relate computability and complexity to issues in the philosophy of mind, the philosophy of science, and the philosophy of mathematics."

Item type:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Home library	Collection	Call number	Materials specified	Status	Date due	Barcode
Electronic-Books	OPJGU Sonepat- Campus	E-Books EBSCO			Available

Includes bibliographical references and index.

"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 into the foundations of mathematics. In the decades since, the theory of computability has moved to the center of discussions in philosophy, computer science, and cognitive science. In this volume, distinguished computer scientists, mathematicians, logicians, and philosophers consider the conceptual foundations of computability in light of our modern understanding. Some chapters focus on the pioneering work by Turing, Gödel, and Church, including the Church-Turing thesis and Gödel's response to Church's and Turing's proposals. Other chapters cover more recent technical developments, including computability over the reals, Gödel's influence on mathematical logic and on recursion theory and the impact of work by Turing and Emil Post on our theoretical understanding of online and interactive computing; and others relate computability and complexity to issues in the philosophy of mind, the philosophy of science, and the philosophy of mathematics."