{"product_id":"computability-and-unsolvability-paperback","title":"Computability and Unsolvability - Paperback","description":"\u003cdiv\u003e\u003cp style=\"text-align: right;\"\u003e\u003ca href=\"https:\/\/reportcopyrightinfringement.com\/\" target=\"_blank\" rel=\"nofollow\"\u003e\u003cb\u003eReport copyright infringement\u003c\/b\u003e\u003c\/a\u003e\u003c\/p\u003e\u003c\/div\u003e\u003cp\u003eby \u003cb\u003eMartin Davis\u003c\/b\u003e (Author)\u003c\/p\u003e\u003cp\u003eIn this classic text, Dr. Davis provides a clear introduction to computability, at an advanced undergraduate level, that serves the needs of specialists and non-specialists alike.\u003cbr\u003eIn Part One (Chapters 1-5), Professor Davis outlines the general theory of computability, discussing such topics as computable functions, operations on computable functions, recursive functions, Turing machines, self-applied, and unsolvable decision problems. The author has been careful, especially in the first seven chapters, to assume no special mathematical training on the part of the reader.\u003cbr\u003ePart Two (Chapters 6-8) comprises a concise treatment of applications of the general theory, incorporating material on combinatorial problems, Diophantine Equations (including Hilbert's Tenth Problem) and mathematical logic. The final three chapters (Part 3) present further development of the general theory, encompassing the Kleene hierarchy, computable functionals, and the classification of unsolvable decision problems.\u003cbr\u003eWhen first published in 1958, this work introduced much terminology that has since become standard in theoretical computer science. Indeed, the stature of the book is such that many computer scientists regard it as their theoretical introduction to the topic. This new Dover edition makes this pioneering, widely admired text available in an inexpensive format.\u003cbr\u003eFor Dover's edition, Dr. Davis has provided a new Preface and an Appendix, Hilbert's Tenth Problem Is Unsolvable, an important article he published in \u003ci\u003eThe American Mathematical Monthly\u003c\/i\u003e in 1973, which was awarded prizes by the American Mathematical Society and the Mathematical Association of America. These additions further enhance the value and usefulness of an unusually clear and stimulating exposition (Centre National de la Recherche Scientifique, Paris) now available for the first time in paperback.\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\n            \u003cdiv\u003e\n\u003cstrong\u003eNumber of Pages:\u003c\/strong\u003e 288\u003c\/div\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003eDimensions:\u003c\/strong\u003e 0.57 x 8.46 x 5.44 IN\u003c\/div\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003ePublication Date:\u003c\/strong\u003e December 01, 1985\u003c\/div\u003e\n            ","brand":"BooksCloud","offers":[{"title":"Default Title","offer_id":45390260109414,"sku":"9780486614717","price":24.63,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0599\/7255\/0758\/files\/Mk9ON0tWRGdqSGRKaDBqRU5TZXJDQT09.webp?v=1775094628","url":"https:\/\/infinitylightwa.com\/products\/computability-and-unsolvability-paperback","provider":"Infinity Light","version":"1.0","type":"link"}