Internformat: Computability :

Computability :: Turing, Gödel, Church, and beyond /

"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 in...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Weitere Verfasser:	Copeland, B. Jack, 1950- (HerausgeberIn), Posy, Carl J. (HerausgeberIn), Shagrir, Oron, 1961- (HerausgeberIn)
Format:	Elektronisch E-Book
Sprache:	English
Veröffentlicht:	Cambridge, Massachusetts : The MIT Press, [2013]
Schlagworte:	Computational complexity. Mathematics > Philosophy. Complexité de calcul (Informatique) Mathématiques > Philosophie. COMPUTERS > Machine Theory. Computational complexity Mathematics > Philosophy COMPUTER SCIENCE/General MATHEMATICS & STATISTICS/General PHILOSOPHY/General
Online-Zugang:	Volltext
Zusammenfassung:	"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."
Beschreibung:	1 online resource
Bibliographie:	Includes bibliographical references and index.
ISBN:	9781461931843 1461931843 0262312670 9780262312677 9780262312660 0262312662 1299688004 9781299688001 9780262312684 0262312689 9780262527484 0262527480

Internformat

MARC


LEADER	00000cam a2200000 a 4500
001	ZDB-4-EBA-ocn849928726
003	OCoLC
005	20241004212047.0
006	m o d
007	cr cnu---unuuu
008	130624s2013 mau ob 001 0 eng d
010			\|z 2012039321
040			\|a N$T \|b eng \|e pn \|c N$T \|d YDXCP \|d CDX \|d OCLCF \|d IEEEE \|d IDEBK \|d AZU \|d COO \|d OCLCQ \|d OCLCO \|d TEFOD \|d OCLCQ \|d TEFOD \|d P@U \|d OCLCQ \|d HRM \|d AGLDB \|d CCO \|d COCUF \|d LOA \|d MERUC \|d MOR \|d PIFAG \|d FVL \|d YDX \|d OTZ \|d OCLCQ \|d EBLCP \|d DEBSZ \|d ZCU \|d U3W \|d OCLCQ \|d STF \|d WRM \|d VTS \|d CEF \|d CRU \|d MERER \|d ICG \|d OCLCQ \|d CUY \|d OCLCQ \|d INT \|d VT2 \|d REC \|d OCLCQ \|d WYU \|d MITPR \|d YOU \|d TKN \|d OCLCQ \|d LEAUB \|d DKC \|d AU@ \|d OCLCQ \|d M8D \|d OL$ \|d OCLCQ \|d K6U \|d OCLCQ \|d SNU \|d LUN \|d AJS \|d OCLCQ \|d QGK \|d OCLCO \|d OCLCQ \|d INARC \|d OCLCO \|d OCLCL \|d OCLCQ
019			\|a 851157227 \|a 868204323 \|a 881288837 \|a 923251995 \|a 964598875 \|a 1077801349 \|a 1167203408 \|a 1259075017
020			\|a 9781461931843 \|q (electronic bk.)
020			\|a 1461931843 \|q (electronic bk.)
020			\|a 0262312670 \|q (electronic bk.)
020			\|a 9780262312677 \|q (electronic bk.)
020			\|a 9780262312660 \|q (electronic bk.)
020			\|a 0262312662 \|q (electronic bk.)
020			\|a 1299688004 \|q (electronic bk.)
020			\|a 9781299688001 \|q (electronic bk.)
020			\|a 9780262312684 \|q (electronic bk.)
020			\|a 0262312689 \|q (electronic bk.)
020			\|a 9780262527484 \|q (print)
020			\|a 0262527480
020			\|z 9780262018999
020			\|z 0262018993
035			\|a (OCoLC)849928726 \|z (OCoLC)851157227 \|z (OCoLC)868204323 \|z (OCoLC)881288837 \|z (OCoLC)923251995 \|z (OCoLC)964598875 \|z (OCoLC)1077801349 \|z (OCoLC)1167203408 \|z (OCoLC)1259075017
037			\|a 500050 \|b MIL
037			\|a 8A60D5BF-FE96-4464-B278-4F4959682ACF \|b OverDrive, Inc. \|n http://www.overdrive.com
037			\|a 8009 \|b MIT Press
037			\|a 9780262312677 \|b MIT Press
050		4	\|a QA267.7 \|b .C677 2013eb
072		7	\|a COM \|x 037000 \|2 bisacsh
082	7		\|a 511.3/52 \|2 23
049			\|a MAIN
245	0	0	\|a Computability : \|b Turing, Gödel, Church, and beyond / \|c edited by Jack Copeland, Carl Posy, and Oron Shagrir.
260			\|a Cambridge, Massachusetts : \|b The MIT Press, \|c [2013]
300			\|a 1 online resource
336			\|a text \|b txt \|2 rdacontent
337			\|a computer \|b c \|2 rdamedia
338			\|a online resource \|b cr \|2 rdacarrier
504			\|a Includes bibliographical references and index.
520	3		\|a "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."
588	0		\|a Print version record.
505	0		\|a 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.
546			\|a English.
650		0	\|a Computational complexity. \|0 http://id.loc.gov/authorities/subjects/sh85029473
650		0	\|a Mathematics \|x Philosophy. \|0 http://id.loc.gov/authorities/subjects/sh85082153
650		6	\|a Complexité de calcul (Informatique)
650		6	\|a Mathématiques \|x Philosophie.
650		7	\|a COMPUTERS \|x Machine Theory. \|2 bisacsh
650		7	\|a Computational complexity \|2 fast
650		7	\|a Mathematics \|x Philosophy \|2 fast
653			\|a COMPUTER SCIENCE/General
653			\|a MATHEMATICS & STATISTICS/General
653			\|a PHILOSOPHY/General
700	1		\|a Copeland, B. Jack, \|d 1950- \|e editor. \|0 http://id.loc.gov/authorities/names/n2003013129
700	1		\|a Posy, Carl J., \|e editor.
700	1		\|a Shagrir, Oron, \|d 1961- \|e editor. \|0 http://id.loc.gov/authorities/names/no2005037871
776	0	8	\|i Print version: \|t Computability. \|d Cambridge, Massachusetts : The MIT Press, [2013] \|z 9780262018999 \|w (DLC) 2012039321 \|w (OCoLC)813540892
856	4	0	\|l FWS01 \|p ZDB-4-EBA \|q FWS_PDA_EBA \|u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=601413 \|3 Volltext
938			\|a Internet Archive \|b INAR \|n isbn_9780262018999
938			\|a Coutts Information Services \|b COUT \|n 25750409
938			\|a ProQuest Ebook Central \|b EBLB \|n EBL3339630
938			\|a EBSCOhost \|b EBSC \|n 601413
938			\|a ProQuest MyiLibrary Digital eBook Collection \|b IDEB \|n cis25750409
938			\|a IEEE \|b IEEE \|n 6554353
938			\|a Project MUSE \|b MUSE \|n muse46464
938			\|a YBP Library Services \|b YANK \|n 10803599
994			\|a 92 \|b GEBAY
912			\|a ZDB-4-EBA
049			\|a DE-863

Datensatz im Suchindex

DE-BY-FWS_katkey	ZDB-4-EBA-ocn849928726
_version_	1816882236741386241
adam_text
any_adam_object
author2	Copeland, B. Jack, 1950- Posy, Carl J. Shagrir, Oron, 1961-
author2_role	edt edt edt
author2_variant	b j c bj bjc c j p cj cjp o s os
author_GND	http://id.loc.gov/authorities/names/n2003013129 http://id.loc.gov/authorities/names/no2005037871
author_facet	Copeland, B. Jack, 1950- Posy, Carl J. Shagrir, Oron, 1961-
building	Verbundindex
bvnumber	localFWS
callnumber-first	Q - Science
callnumber-label	QA267
callnumber-raw	QA267.7 .C677 2013eb
callnumber-search	QA267.7 .C677 2013eb
callnumber-sort	QA 3267.7 C677 42013EB
callnumber-subject	QA - Mathematics
collection	ZDB-4-EBA
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.
ctrlnum	(OCoLC)849928726
dewey-full	511.3/52
dewey-hundreds	500 - Natural sciences and mathematics
dewey-ones	511 - General principles of mathematics
dewey-raw	511.3/52
dewey-search	511.3/52
dewey-sort	3511.3 252
dewey-tens	510 - Mathematics
discipline	Mathematik
format	Electronic eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05963cam a2200829 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn849928726</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">130624s2013 mau ob 001 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="z"> 2012039321</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">YDXCP</subfield><subfield code="d">CDX</subfield><subfield code="d">OCLCF</subfield><subfield code="d">IEEEE</subfield><subfield code="d">IDEBK</subfield><subfield code="d">AZU</subfield><subfield code="d">COO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">TEFOD</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">TEFOD</subfield><subfield code="d">P@U</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">HRM</subfield><subfield code="d">AGLDB</subfield><subfield code="d">CCO</subfield><subfield code="d">COCUF</subfield><subfield code="d">LOA</subfield><subfield code="d">MERUC</subfield><subfield code="d">MOR</subfield><subfield code="d">PIFAG</subfield><subfield code="d">FVL</subfield><subfield code="d">YDX</subfield><subfield code="d">OTZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">EBLCP</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">ZCU</subfield><subfield code="d">U3W</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">STF</subfield><subfield code="d">WRM</subfield><subfield code="d">VTS</subfield><subfield code="d">CEF</subfield><subfield code="d">CRU</subfield><subfield code="d">MERER</subfield><subfield code="d">ICG</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">CUY</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">INT</subfield><subfield code="d">VT2</subfield><subfield code="d">REC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">WYU</subfield><subfield code="d">MITPR</subfield><subfield code="d">YOU</subfield><subfield code="d">TKN</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">LEAUB</subfield><subfield code="d">DKC</subfield><subfield code="d">AU@</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">M8D</subfield><subfield code="d">OL$</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">K6U</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">SNU</subfield><subfield code="d">LUN</subfield><subfield code="d">AJS</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">QGK</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">INARC</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">851157227</subfield><subfield code="a">868204323</subfield><subfield code="a">881288837</subfield><subfield code="a">923251995</subfield><subfield code="a">964598875</subfield><subfield code="a">1077801349</subfield><subfield code="a">1167203408</subfield><subfield code="a">1259075017</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461931843</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1461931843</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262312670</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262312677</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262312660</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262312662</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1299688004</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781299688001</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262312684</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262312689</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262527484</subfield><subfield code="q">(print)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262527480</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780262018999</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0262018993</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)849928726</subfield><subfield code="z">(OCoLC)851157227</subfield><subfield code="z">(OCoLC)868204323</subfield><subfield code="z">(OCoLC)881288837</subfield><subfield code="z">(OCoLC)923251995</subfield><subfield code="z">(OCoLC)964598875</subfield><subfield code="z">(OCoLC)1077801349</subfield><subfield code="z">(OCoLC)1167203408</subfield><subfield code="z">(OCoLC)1259075017</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">500050</subfield><subfield code="b">MIL</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">8A60D5BF-FE96-4464-B278-4F4959682ACF</subfield><subfield code="b">OverDrive, Inc.</subfield><subfield code="n">http://www.overdrive.com</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">8009</subfield><subfield code="b">MIT Press</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">9780262312677</subfield><subfield code="b">MIT Press</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA267.7</subfield><subfield code="b">.C677 2013eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">037000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.3/52</subfield><subfield code="2">23</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Computability :</subfield><subfield code="b">Turing, Gödel, Church, and beyond /</subfield><subfield code="c">edited by Jack Copeland, Carl Posy, and Oron Shagrir.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge, Massachusetts :</subfield><subfield code="b">The MIT Press,</subfield><subfield code="c">[2013]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">"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."</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computational complexity.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85029473</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Mathematics</subfield><subfield code="x">Philosophy.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85082153</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Mathématiques</subfield><subfield code="x">Philosophie.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Machine Theory.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational complexity</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="x">Philosophy</subfield><subfield code="2">fast</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">COMPUTER SCIENCE/General</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">MATHEMATICS & STATISTICS/General</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">PHILOSOPHY/General</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Copeland, B. Jack,</subfield><subfield code="d">1950-</subfield><subfield code="e">editor.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n2003013129</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Posy, Carl J.,</subfield><subfield code="e">editor.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shagrir, Oron,</subfield><subfield code="d">1961-</subfield><subfield code="e">editor.</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2005037871</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="t">Computability.</subfield><subfield code="d">Cambridge, Massachusetts : The MIT Press, [2013]</subfield><subfield code="z">9780262018999</subfield><subfield code="w">(DLC) 2012039321</subfield><subfield code="w">(OCoLC)813540892</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=601413</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Internet Archive</subfield><subfield code="b">INAR</subfield><subfield code="n">isbn_9780262018999</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Coutts Information Services</subfield><subfield code="b">COUT</subfield><subfield code="n">25750409</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL3339630</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">601413</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">cis25750409</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">IEEE</subfield><subfield code="b">IEEE</subfield><subfield code="n">6554353</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Project MUSE</subfield><subfield code="b">MUSE</subfield><subfield code="n">muse46464</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10803599</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection>
id	ZDB-4-EBA-ocn849928726
illustrated	Not Illustrated
indexdate	2024-11-27T13:25:24Z
institution	BVB
isbn	9781461931843 1461931843 0262312670 9780262312677 9780262312660 0262312662 1299688004 9781299688001 9780262312684 0262312689 9780262527484 0262527480
language	English
oclc_num	849928726
open_access_boolean
owner	MAIN DE-863 DE-BY-FWS
owner_facet	MAIN DE-863 DE-BY-FWS
physical	1 online resource
psigel	ZDB-4-EBA
publishDate	2013
publishDateSearch	2013
publishDateSort	2013
publisher	The MIT Press,
record_format	marc
spelling	Computability : Turing, Gödel, Church, and beyond / edited by Jack Copeland, Carl Posy, and Oron Shagrir. Cambridge, Massachusetts : The MIT Press, [2013] 1 online resource text txt rdacontent computer c rdamedia online resource cr rdacarrier 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." Print version record. 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. English. Computational complexity. http://id.loc.gov/authorities/subjects/sh85029473 Mathematics Philosophy. http://id.loc.gov/authorities/subjects/sh85082153 Complexité de calcul (Informatique) Mathématiques Philosophie. COMPUTERS Machine Theory. bisacsh Computational complexity fast Mathematics Philosophy fast COMPUTER SCIENCE/General MATHEMATICS & STATISTICS/General PHILOSOPHY/General Copeland, B. Jack, 1950- editor. http://id.loc.gov/authorities/names/n2003013129 Posy, Carl J., editor. Shagrir, Oron, 1961- editor. http://id.loc.gov/authorities/names/no2005037871 Print version: Computability. Cambridge, Massachusetts : The MIT Press, [2013] 9780262018999 (DLC) 2012039321 (OCoLC)813540892 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=601413 Volltext
spellingShingle	Computability : Turing, Gödel, Church, and beyond / 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. Computational complexity. http://id.loc.gov/authorities/subjects/sh85029473 Mathematics Philosophy. http://id.loc.gov/authorities/subjects/sh85082153 Complexité de calcul (Informatique) Mathématiques Philosophie. COMPUTERS Machine Theory. bisacsh Computational complexity fast Mathematics Philosophy fast
subject_GND	http://id.loc.gov/authorities/subjects/sh85029473 http://id.loc.gov/authorities/subjects/sh85082153
title	Computability : Turing, Gödel, Church, and beyond /
title_auth	Computability : Turing, Gödel, Church, and beyond /
title_exact_search	Computability : Turing, Gödel, Church, and beyond /
title_full	Computability : Turing, Gödel, Church, and beyond / edited by Jack Copeland, Carl Posy, and Oron Shagrir.
title_fullStr	Computability : Turing, Gödel, Church, and beyond / edited by Jack Copeland, Carl Posy, and Oron Shagrir.
title_full_unstemmed	Computability : Turing, Gödel, Church, and beyond / edited by Jack Copeland, Carl Posy, and Oron Shagrir.
title_short	Computability :
title_sort	computability turing godel church and beyond
title_sub	Turing, Gödel, Church, and beyond /
topic	Computational complexity. http://id.loc.gov/authorities/subjects/sh85029473 Mathematics Philosophy. http://id.loc.gov/authorities/subjects/sh85082153 Complexité de calcul (Informatique) Mathématiques Philosophie. COMPUTERS Machine Theory. bisacsh Computational complexity fast Mathematics Philosophy fast
topic_facet	Computational complexity. Mathematics Philosophy. Complexité de calcul (Informatique) Mathématiques Philosophie. COMPUTERS Machine Theory. Computational complexity Mathematics Philosophy
url	https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=601413
work_keys_str_mv	AT copelandbjack computabilityturinggodelchurchandbeyond AT posycarlj computabilityturinggodelchurchandbeyond AT shagriroron computabilityturinggodelchurchandbeyond

Verfügbarkeit

MARC

Datensatz im Suchindex

Ähnliche Einträge