Category=PDA
Category=UYA
Category=UYQ
eq_bestseller
eq_computing
eq_isMigrated=0
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
eq_science
Product details
- ISBN 9780198537748
- Weight: 992g
- Dimensions: 155 x 236mm
- Publication Date: 15 Aug 1991
- Publisher: Oxford University Press
- Publication City/Country: GB
- Product Form: Paperback
Secure
checkout
Fast Shipping
Easy returns
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 Entscheidungs problem" 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 I of the volume explores the historical aspect with essays on the background, on Turing's work, and on subsequent developments. Part II 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.
