This volume commemorates the work of Alan Turing, because it was Turing who not only introduced the most persuasive and influential concept of a machine model of effective computability but who also anticipated in his work the diversity of topics brought together here. As Newman put it in his memoir of Turing, "The central problem with which he started and to which he constantly returned is the extent and the limitations of mechanistic explanations of nature." Turing's paper "On computable numbers, with an application to the Entscheidungsproblem" appeared in print in 1937. It contained Turing's thesis that every 'effective' computation can be programmed on a Turing machine. Furthermore, it contained the unsolvability of the halting problem and of the decision problem for first-order logic, and it presented the invention of the universal Turing machine. The publication of this idea is acknowledged as a landmark of the computer age. Part 1 of the volume explores the historical aspect with essays on the background, on Turing's work, and on subsequent developments. Part 2 contains an extensive series of essays on the influence and applications of these ideas in mathematics, mathematical logic, philosophy of mathematics, computer science, artificial intelligence, philosophy of language, philosophy of mind, and physics. Anyone interested in Turing and his ideas; Computer scientists, logicians, mathematicians, AI researchers, physicists, and other scientists; Historians of mathematics, computing, and science; Philosophers.
"Sinopsis" puede pertenecer a otra edición de este libro.
This volume commemorates the work of Alan Turing, because it was Turing who not only introduced the most persuasive and influential concept of a machine model of effective computability but who also anticipated in his work the diversity of topics brought together here. As Newman put it in his memoir of Turing, "The central problem with which he started and to which he constantly returned is the extent and the limitations of mechanistic explanations of nature." Turing's paper "On computable numbers, with an application to the Entscheidungsproblem" appeared in print in 1937. It contained Turing's thesis that every 'effective' computation can be programmed on a Turing machine. Furthermore, it contained the unsolvability of the halting problem and of the decision problem for first-order logic, and it presented the invention of the universal Turing machine. The publication of this idea is acknowledged as a landmark of the computer age. Part 1 of the volume explores the historical aspect with essays on the background, on Turing's work, and on subsequent developments. Part 2 contains an extensive series of essays on the influence and applications of these ideas in mathematics, mathematical logic, philosophy of mathematics, computer science, artificial intelligence, philosophy of language, philosophy of mind, and physics. Anyone interested in Turing and his ideas; Computer scientists, logicians, mathematicians, AI researchers, physicists, and other scientists; Historians of mathematics, computing, and science; Philosophers.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 26,11 gastos de envío desde Canada a España
Destinos, gastos y plazos de envíoLibrería: Rosenbloom Rare Books, Ottawa, ON, Canada
Condición: Very Good. 661pp, no dustjacket, previous owners name stamp on flyleaf otherwise unmarked. Nº de ref. del artículo: 4446173
Cantidad disponible: 1 disponibles
Librería: About Books, Henderson, NV, Estados Unidos de America
Hardcover. Condición: Near Fine EX-LIBRARY. Estado de la sobrecubierta: No dust jacket. First Edition. Oxford: Oxford University Press, 1988. A very nice copy. Near Fine EX-LIBRARY. Bright, clean, square, and reasonably tight. Inner hinges are perfect. WITHDRAWN stamp, and a few other library markings. Text pages are fresh and crisp. No underlining. No highlighting. No margin notes. Bibliographical references. Handsomely bound in the original blue cloth, stamped in red shiny gold on the spine and front cover. Among the international specialists in logic, computability, mathematics, biology, physics, linguistics, and cognitive science who contributed to this volume are: Andrew Hodges, Stephen C. Kleene, Robin Gandy, Solomon Feferman, Martin Davis, Michael A. Arbib, Michael J. Beeson, Charles H. Bennett, Allen H. Brady, Gregory J. Chaitin, Michael Conrad, Elias Dahlhaus, Johann A. Makowsky, Jens Erik Fenstad, David Finkelstein, Oded Goldreich, Yuri Gurevich, Brosl Hasslacher, Moshe Koppel, Oswald Wiener, etc. From the preface: "The papers in this volume were written on the occasion of the fiftieth anniversary of the publication of Alan Turing's paper ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM in 1937. Turing's paper contained what may now be called Turing's Thesis, namely that every 'effective' computation can be programmed on a Turing machine. Furthermore it proved the unsolvability of the halting problem and of the decision problem for first order logic, and it presented the invention of the universal Turing machine. It is that publication of this idea that will presumably be acknowledged as marking sub specie aeternitatis the beginning of the 'computer age.'" . First Edition. Hardcover. Near Fine EX-LIBRARY/No dust jacket. 8vo. xiv, 661pp. [675 total pages]. Great Packaging, Fast Shipping. Nº de ref. del artículo: 007452
Cantidad disponible: 1 disponibles
Librería: Vellum is the GOAT, San Rafael, CA, Estados Unidos de America
Hardcover. Condición: Very Good. xiv, 661 pages : illustrations ; 25 cm. Nº de ref. del artículo: CNH0005917
Cantidad disponible: 1 disponibles
Librería: dsmbooks, Liverpool, Reino Unido
Hardcover. Condición: Good. Good. book. Nº de ref. del artículo: D8S0-3-M-0198537417-2
Cantidad disponible: 1 disponibles