Computability: Turing, Godel, Church, and Beyond

Copeland, B Jack (Editor), Posy, Carl J (Editor), Shagrir, Oron (Editor)

Computability: Turing, Godel, Church, and Beyond
  • 出版商: MIT
  • 出版日期: 2015-02-01
  • 售價: $1,050
  • 貴賓價: 9.8 折 $1,029
  • 語言: 英文
  • 頁數: 376
  • 裝訂: Paperback
  • ISBN: 0262527480
  • ISBN-13: 9780262527484
  • 相關分類: Computer-Science、邏輯設計 Logic-design

    • 立即出貨 (庫存 < 3)

買這商品的人也買了...

商品描述

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

商品描述(中文翻譯)

在1930年代，由Alan Turing、Kurt Gödel、Alonzo Church等人發表的一系列重要作品奠定了計算可行性的理論基礎。這項工作對於有效的演算法計算進行了精確的描述，是對數學基礎的深入研究的結果。在過去的幾十年中，計算可行性理論已成為哲學、計算機科學和認知科學討論的核心。在這本書中，著名的計算機科學家、數學家、邏輯學家和哲學家根據我們對計算可行性的現代理解，考慮了其概念基礎。一些章節聚焦於Turing、Gödel和Church的開創性工作，包括Church-Turing論題和Gödel對Church和Turing提案的回應。其他章節涵蓋了更近期的技術發展，包括對實數的可計算性、Gödel對數學邏輯和遞迴理論的影響，以及Turing和Emil Post的工作對我們對線上和互動計算的理論理解的影響；還有其他章節將可計算性和複雜性與心靈哲學、科學哲學和數學哲學的問題相關聯。

貢獻者：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

類似商品