第 1/7 張圖片
圖片庫
第 1/7 張圖片
有類似物品要出售？
Computability: Turing, Gödel, Church, and Beyond. Posy. 2013. HCDJ.
US $40.00
大約HK$ 311.31
或講價
狀況：
“Hardcover with dust jacket in good condition. Some underlining and marginalia.”
良好
曾被閱讀過的書籍，但狀況良好。封面有諸如磨痕等在內的極少損壞，但沒有穿孔或破損。精裝本書籍可能沒有書皮。封皮稍有磨損。絕大多數書頁未受損，存在極少的褶皺和破損。使用鉛筆標注文字處極少，未對文字標記，無留白處書寫文字。沒有缺頁。
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
見面交收或取貨：
可於Johnson City, Tennessee, 美國免費本地見面交收.
運送：
US $5.22（大約 HK$ 40.63） USPS Media MailTM.
所在地：Johnson City, Tennessee, 美國
送達日期：
估計於 10月9日 (星期四)至 10月15日 (星期三)之間送達 運送地點 94104
退貨：
14 日退貨. 由買家支付退貨運費，如果你使用 eBay 郵寄標籤，相關費用將從你的退款金額中扣除.
保障：
請參閱物品說明或聯絡賣家以取得詳細資料。閱覽全部詳情查看保障詳情
（不符合「eBay 買家保障方案」資格）
物品細節
- 物品狀況
- 良好
- 賣家備註
- “Hardcover with dust jacket in good condition. Some underlining and marginalia.”
- ISBN
- 9780262018999
關於產品
Product Identifiers
Publisher
MIT Press
ISBN-10
0262018993
ISBN-13
9780262018999
eBay Product ID (ePID)
143576949
Product Key Features
Number of Pages
376 Pages
Language
English
Publication Name
Computability : Turing, Gödel, Church, and Beyond
Publication Year
2013
Subject
Machine Theory, History & Philosophy, Computer Science, History
Type
Textbook
Subject Area
Mathematics, Computers
Format
Hardcover
Dimensions
Item Height
0.9 in
Item Weight
26.9 Oz
Item Length
9.3 in
Item Width
7.5 in
Additional Product Features
Intended Audience
Scholarly & Professional
LCCN
2012-039321
Dewey Edition
23
Grade From
College Graduate Student
Illustrated
Yes
Dewey Decimal
511.352
Synopsis
In the 1930s a series of seminal works published by Alan Turing, Kurt Godel, 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, Godel, and Church, including the Church-Turing thesis and Godel's response to Church's and Turing's proposals. Other chapters cover more recent technical developments, including computability over the reals, Godel'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 ", 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
LC Classification Number
QA267.7.C677 2013
賣家提供的物品說明
賣家信用評價 （5,639）
- eBay automated Feedback- 買家留下的信用評價。過去 1 個月Order delivered on time with no issues
- eBay automated Feedback- 買家留下的信用評價。過去 1 個月Order delivered on time with no issues
- m***i (493)- 買家留下的信用評價。過去 1 個月購買已獲認證Very pleased with purchase! Item just as described, packaged well and shipped fast. Five star seller! 🌟🌟🌟🌟🌟
賣家信用評價 （5,639）
- eBay automated Feedback- 買家留下的信用評價。過去 1 個月Order delivered on time with no issues
- eBay automated Feedback- 買家留下的信用評價。過去 1 個月Order delivered on time with no issues
- m***i (493)- 買家留下的信用評價。過去 1 個月購買已獲認證Very pleased with purchase! Item just as described, packaged well and shipped fast. Five star seller! 🌟🌟🌟🌟🌟