TY  - GEN
N2  - "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."
AB  - "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."
T1  - Computability :Turing, Gödel, Church, and beyond /
DA  - [2013]
CY  - Cambridge, Massachusetts :
AU  - Copeland, B. Jack,
AU  - Posy, Carl J.,
AU  - Shagrir, Oron,
CN  - QA267.7
PB  - The MIT Press,
PP  - Cambridge, Massachusetts :
PY  - [2013]
ID  - 1385509
KW  - Computational complexity.
KW  - Mathematics
KW  - COMPUTER SCIENCE/General
KW  - MATHEMATICS & STATISTICS/General
KW  - PHILOSOPHY/General
SN  - 9781461931843
SN  - 1461931843
SN  - 0262312670
SN  - 9780262312677
SN  - 9780262312660
SN  - 0262312662
SN  - 1299688004
SN  - 9781299688001
SN  - 9780262312684
SN  - 0262312689
TI  - Computability :Turing, Gödel, Church, and beyond /
LK  - https://univsouthin.idm.oclc.org/login?url=https://doi.org/10.7551/mitpress/8009.001.0001?locatt=mode:legacy
LK  - http://www.oclc.org/content/dam/oclc/forms/terms/vbrl-201703.pdf
UR  - https://univsouthin.idm.oclc.org/login?url=https://doi.org/10.7551/mitpress/8009.001.0001?locatt=mode:legacy
UR  - http://www.oclc.org/content/dam/oclc/forms/terms/vbrl-201703.pdf
ER  -