{"product_id":"the-undecidable-basic-papers-on-undecidable-propositions-unsolvable-problems-and-computable-functions-paperback","title":"The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions - Paperback","description":"\u003cp\u003eby \u003cb\u003eMartin Davis\u003c\/b\u003e (Editor)\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003eA valuable collection both for original source material as well as historical formulations of current problems. -- \u003ci\u003eThe Review of Metaphysics\u003cbr\u003e\u003c\/i\u003eMuch more than a mere collection of papers. A valuable addition to the literature. -- \u003ci\u003eMathematics of Computation\u003cbr\u003e\u003c\/i\u003eAn anthology of fundamental papers on undecidability and unsolvability by major figures in the field, this classic reference is ideally suited as a text for graduate and undergraduate courses in logic, philosophy, and foundations of mathematics. It is also appropriate for self-study.\u003cbr\u003eThe text opens with Godel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by Godel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. Additional papers by Church, Turing, and Post cover unsolvable problems from the theory of abstract computing machines, mathematical logic, and algebra, and material by Kleene and Post includes initiation of the classification theory of unsolvable problems.\u003cbr\u003eSupplementary items include corrections, emendations, and added commentaries by Godel, Church, and Kleene for this volume's original publication, along with a helpful commentary by the editor.\u003c\/p\u003e\u003ch3\u003eAuthor Biography\u003c\/h3\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003e\u003cb\u003eMartin Davis: Computer Science Pioneer \u003cbr\u003e\u003c\/b\u003eDover's publishing relationship with Martin Davis, now retired from NYU and living in Berkeley, goes back to 1985 when we reprinted his classic 1958 book \u003ci\u003eComputability and Unsolvability, \u003c\/i\u003e widely regarded as a classic of theoretical computer science. A graduate of New York's City College, Davis received his PhD from Princeton in the late 1940s and became one of the first computer programmers in the early 1950s, working on the ORDVAC computer at The University of Illinois. He later settled at NYU where he helped found the Computer Science Department. \u003c\/p\u003e\u003cp\u003eNot many books from the infancy of computer science are still alive after several decades, but \u003ci\u003eComputability and Unsolvability\u003c\/i\u003e is the exception. And \u003ci\u003eThe Undecidable\u003c\/i\u003e is an anthology of fundamental papers on undecidability and unsolvability by major figures in the field including Godel, Church, Turing, Kleene, and Post. \u003c\/p\u003e\u003cp\u003e\u003cb\u003e \u003c\/b\u003e\u003c\/p\u003e\u003cp\u003eCritical Acclaim for \u003ci\u003eComputability and Unsolvability\u003c\/i\u003e: \u003cbr\u003eThis book gives an expository account of the theory of recursive functions and some of its applications to logic and mathematics. It is well written and can be recommended to anyone interested in this field. No specific knowledge of other parts of mathematics is presupposed. Though there are no exercises, the book is suitable for use as a textbook. -- J. C. E. Dekker, \u003ci\u003eBulletin of the American Mathematical Society\u003c\/i\u003e, 1959\u003cb\u003e \u003c\/b\u003e\u003c\/p\u003e\u003cp\u003eCritical Acclaim for \u003ci\u003eThe Undecidable\u003c\/i\u003e: \u003cbr\u003eA valuable collection both for original source material as well as historical formulations of current problems. -- \u003ci\u003eThe Review of Metaphysics\u003c\/i\u003e \u003c\/p\u003e\u003cp\u003eMuch more than a mere collection of papers . . . a valuable addition to the literature. -- \u003ci\u003eMathematics of Computation\u003c\/i\u003e\u003c\/p\u003e\u003cdiv\u003e\n\u003cstrong\u003eNumber of Pages:\u003c\/strong\u003e 413\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003eDimensions:\u003c\/strong\u003e 0.85 x 9.16 x 6.44 IN\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003eIllustrated:\u003c\/strong\u003e Yes\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003ePublication Date:\u003c\/strong\u003e February 18, 2004\u003c\/div\u003e","brand":"Books by splitShops","offers":[{"title":"Default Title","offer_id":42694413844543,"sku":"9780486432281","price":29.94,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0105\/8226\/1823\/files\/d3cb21f3382b80c6797d9a8fbe6f4644.webp?v=1765001371","url":"https:\/\/dhlswag.com\/products\/the-undecidable-basic-papers-on-undecidable-propositions-unsolvable-problems-and-computable-functions-paperback","provider":"BBB","version":"1.0","type":"link"}