000 | 03370nam a2200505 i 4500 | ||
---|---|---|---|
001 | 6554353 | ||
003 | IEEE | ||
005 | 20220712204812.0 | ||
006 | m o d | ||
007 | cr |n||||||||| | ||
008 | 151223s2013 mau ob 001 eng d | ||
020 |
_a9780262312677 _qelectronic |
||
020 |
_z9780262018999 _qhardcover : alk. paper |
||
020 |
_z0262312670 _qelectronic |
||
020 |
_z9780262527484 _qprint |
||
035 | _a(CaBNVSL)mat06554353 | ||
035 | _a(IDAMS)0b00006481dbdd45 | ||
040 |
_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL |
||
050 | 4 |
_aQA267.7 _b.C677 2013eb |
|
082 | 0 | 4 |
_a511.3/52 _223 |
245 | 0 | 0 |
_aComputability : _bTuring, G�odel, Church, and beyond / _cedited by Jack Copeland, Carl Posy, and Oron Shagrir. |
264 | 1 |
_aCambridge, Massachusetts : _bMIT Press, _c[2013] |
|
264 | 2 |
_a[Piscataqay, New Jersey] : _bIEEE Xplore, _c[2013] |
|
300 | _a1 PDF (376 pages). | ||
336 |
_atext _2rdacontent |
||
337 |
_aelectronic _2isbdmedia |
||
338 |
_aonline resource _2rdacarrier |
||
504 | _aIncludes bibliographical references and index. | ||
506 | 1 | _aRestricted to subscribers or individual electronic text purchasers. | |
520 | _aIn 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. | ||
530 | _aAlso available in print. | ||
538 | _aMode of access: World Wide Web | ||
588 | _aDescription based on PDF viewed 12/23/2015. | ||
650 | 0 |
_aMathematics _xPhilosophy. _921296 |
|
650 | 0 |
_aComputational complexity. _93729 |
|
655 | 0 |
_aElectronic books. _93294 |
|
700 | 1 |
_aPosy, Carl J, _eeditor. _924076 |
|
700 | 1 |
_aCopeland, B. Jack, _d1950-, _eeditor. _924077 |
|
700 | 1 |
_aShagrir, Oron, _d1961-, _eeditor. _924078 |
|
710 | 2 |
_aIEEE Xplore (Online Service), _edistributor. _924079 |
|
710 | 2 |
_aMIT Press, _epublisher. _924080 |
|
776 | 0 | 8 |
_iPrint version _z9780262527484 |
856 | 4 | 2 |
_3Abstract with links to resource _uhttps://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6554353 |
942 | _cEBK | ||
999 |
_c73330 _d73330 |