Dreadfully Ever After Sale
 
 

Recently Viewed clear list


Original Essays | September 30, 2014

Benjamin Parzybok: IMG A Brief History of Video Games Played by Mayors, Presidents, and Emperors



Brandon Bartlett, the fictional mayor of Portland in my novel Sherwood Nation, is addicted to playing video games. In a city he's all but lost... Continue »
  1. $11.20 Sale Trade Paper add to wish list

    Sherwood Nation

    Benjamin Parzybok 9781618730862

spacer
Qualifying orders ship free.
$38.95
New Hardcover
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
18 Remote Warehouse Personal Computers- General

More copies of this ISBN

Computability: Turing, Godel, Church, and Beyond

by

Computability: Turing, Godel, Church, and Beyond Cover

 

Synopses & Reviews

Publisher Comments:

andlt;Pandgt;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. andlt;/Pandgt;andlt;Pandgt;andlt;Bandgt;Contributors:andlt;/Bandgt;Scott Aaronson, Dorit Aharonov, B. Jack Copeland, Martin Davis, Solomon Feferman, Saul Kripke, Carl J. Posy, Hilary Putnam, Oron Shagrir, Stewart Shapiro, Wilfried Sieg, Robert I. Soare, Umesh V. Vazirani andlt;/Pandgt;

Synopsis:

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.

Contributors:Scott Aaronson, Dorit Aharonov, B. Jack Copeland, Martin Davis, Solomon Feferman, Saul Kripke, Carl J. Posy, Hilary Putnam, Oron Shagrir, Stewart Shapiro, Wilfried Sieg, Robert I. Soare, Umesh V. Vazirani

About the Author

B. Jack Copeland is Professor of Philosophy at the University of Canterbury, New Zealand, and Director of the Turing Archive for the History of Computing. Carl J. Posy is Professor of Philosophy and Member of the Centers for the Study of Rationality and for Language, Logic, and Cognition at the Hebrew University of Jerusalem. Oron Shagrir is Professor of Philosophy and Former Chair of the Cognitive Science Department at the Hebrew University of Jerusalem. He is currently the vice rector of the Hebrew University.

Product Details

ISBN:
9780262018999
Author:
Copeland, B. Jack (edt)
Publisher:
MIT Press (MA)
Author:
Shagrir, Oron
Author:
Copeland, B. Jack
Author:
Posy, Carl J.
Author:
Massachusetts Institute of Technology
Location:
Cambridge
Subject:
Computer Science
Subject:
Personal Computers-General
Copyright:
Series:
Computability
Publication Date:
20130607
Binding:
HARDCOVER
Grade Level:
from 17
Language:
English
Illustrations:
1 band#38;w illus
Pages:
376
Dimensions:
9 x 7 in

Other books you might like

  1. Tender is the night Used Mass Market $4.95
  2. St. Paul's Historic Summit Avenue... New Trade Paper $18.75
  3. The Love of the Last Tycoon: A Western Used Trade Paper $6.50
  4. Fool for Love: F. Scott Fitzgerald... Used Trade Paper $11.00

Related Subjects

Computers and Internet » Computers Reference » General
Computers and Internet » Computers Reference » History and Society
Computers and Internet » Networking » General
Computers and Internet » Personal Computers » General
Science and Mathematics » Featured Titles in Tech » Mathematics & Physics
Science and Mathematics » History of Science » Technology
Science and Mathematics » Mathematics » Foundations and Logic
Science and Mathematics » Mathematics » Logic and Philosophy

Computability: Turing, Godel, Church, and Beyond New Hardcover
0 stars - 0 reviews
$38.95 In Stock
Product details 376 pages MIT Press (MA) - English 9780262018999 Reviews:
"Synopsis" by , 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.

Contributors:Scott Aaronson, Dorit Aharonov, B. Jack Copeland, Martin Davis, Solomon Feferman, Saul Kripke, Carl J. Posy, Hilary Putnam, Oron Shagrir, Stewart Shapiro, Wilfried Sieg, Robert I. Soare, Umesh V. Vazirani

spacer
spacer
  • back to top
Follow us on...




Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.