Título : |
Computability : turing, gödel, church, and beyond |
Tipo de documento: |
texto impreso |
Autores: |
B. Jack Copeland, Autor ; Carl J. Posy, Autor ; Carl J. Posy, Autor ; Carl J. Posy, Autor ; Oron Shagrir, Autor ; Oron Shagrir, Autor ; Oron Shagrir, Autor |
Mención de edición: |
Primera edición |
Editorial: |
Massachusetts : The Mit Press |
Fecha de publicación: |
2013 |
Número de páginas: |
x, 362 páginas |
Dimensiones: |
24 cm |
ISBN/ISSN/DL: |
978-0-262-01899-9 |
Idioma : |
Inglés (eng) |
Clasificación: |
624.183402 Hormigón. Manuales |
Nota de contenido: |
Turing versus gödel on computability and the mind -- Computability and arithmetic -- About and around Computing over the reals -- The Church-Turing "thesis" as a special corollary of gödel's completeness theorem -- Computability and constructibility -- After gödel -- The open texture of computability -- Gödel's philosophical challenge (to Turing) -- Interactive computing and relativized computability -- Why philosophers should care about computational complexity -- Is quantum mechanics falsifiable? A computational perspective on the foundations of quantum mechanics. |
Link: |
https://biblioteca.unap.edu.pe/opac_css/index.php?lvl=notice_display&id=106161 |
Computability : turing, gödel, church, and beyond [texto impreso] / B. Jack Copeland, Autor ; Carl J. Posy, Autor ; Carl J. Posy, Autor ; Carl J. Posy, Autor ; Oron Shagrir, Autor ; Oron Shagrir, Autor ; Oron Shagrir, Autor . - Primera edición . - Massachusetts : The Mit Press, 2013 . - x, 362 páginas ; 24 cm. ISBN : 978-0-262-01899-9 Idioma : Inglés ( eng)
Clasificación: |
624.183402 Hormigón. Manuales |
Nota de contenido: |
Turing versus gödel on computability and the mind -- Computability and arithmetic -- About and around Computing over the reals -- The Church-Turing "thesis" as a special corollary of gödel's completeness theorem -- Computability and constructibility -- After gödel -- The open texture of computability -- Gödel's philosophical challenge (to Turing) -- Interactive computing and relativized computability -- Why philosophers should care about computational complexity -- Is quantum mechanics falsifiable? A computational perspective on the foundations of quantum mechanics. |
Link: |
https://biblioteca.unap.edu.pe/opac_css/index.php?lvl=notice_display&id=106161 |
Computability
Copeland, B. JackPosy, Carl J. ; Posy, Carl J. ; Posy, Carl J. ; Shagrir, Oron ; Shagrir, Oron ; Shagrir, Oron - -
Massachusetts : The Mit Press - 2013
Turing versus gödel on computability and the mind -- Computability and arithmetic -- About and around Computing over the reals -- The Church-Turing "thesis" as a special corollary of gödel's completeness theorem -- Computability and constructibility -- After gödel -- The open texture of computability -- Gödel's philosophical challenge (to Turing) -- Interactive computing and relativized computability -- Why philosophers should care about computational complexity -- Is quantum mechanics falsifiable? A computational perspective on the foundations of quantum mechanics.
|
| |