An anthology of fundamental papers on undecidability and unsolvability, this classic reference opens with Gödel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by Gödel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. 1965 edition.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Martin Davis: Computer Science Pioneer
Dover'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 Computability and Unsolvability, 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.
Not many books from the infancy of computer science are still alive after several decades, but Computability and Unsolvability is the exception. And The Undecidable is an anthology of fundamental papers on undecidability and unsolvability by major figures in the field including Godel, Church, Turing, Kleene, and Post.
Critical Acclaim for Computability and Unsolvability:
"This 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, Bulletin of the American Mathematical Society, 1959
Critical Acclaim for The Undecidable:
"A valuable collection both for original source material as well as historical formulations of current problems." — The Review of Metaphysics
"Much more than a mere collection of papers . . . a valuable addition to the literature." — Mathematics of Computation
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: HPB-Red, Dallas, TX, USA
Paperback. Zustand: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Bestandsnummer des Verkäufers S_412301167
Anbieter: Better World Books: West, Reno, NV, USA
Zustand: Good. Used book that is in clean, average condition without any missing pages. Bestandsnummer des Verkäufers 13648425-75
Anbieter: Half Price Books Inc., Dallas, TX, USA
Paperback. Zustand: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority! Bestandsnummer des Verkäufers S_444847302
Anbieter: agoodealofbooks, Ypsilanti, MI, USA
Paperback. Zustand: Very Good. very clean softcover. no marks. clean text. solid binding. very light wear. ISBN matches listing Fast service with confirmation, no international or priority orders over 4lbs. Bestandsnummer des Verkäufers mon0000153826
Anbieter: Atlantic Bookshop, Brooklyn, NY, USA
Soft cover. Zustand: Very Good. 1st Edition. 8vo, card covers, 413pp. VG+: clean, bright and sound. Bestandsnummer des Verkäufers MACPMDTU
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New. Bestandsnummer des Verkäufers 1717233-n
Anzahl: Mehr als 20 verfügbar
Anbieter: BargainBookStores, Grand Rapids, MI, USA
Paperback or Softback. Zustand: New. The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions. Book. Bestandsnummer des Verkäufers BBS-9780486432281
Anbieter: INDOO, Avenel, NJ, USA
Zustand: New. Brand New. Bestandsnummer des Verkäufers 9780486432281
Anzahl: Mehr als 20 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 1717233
Anzahl: Mehr als 20 verfügbar
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Paperback. Zustand: new. Paperback. ""A valuable collection both for original source material as well as historical formulations of current problems."" - The Review of Metaphysics""Much more than a mere collection of papers. A valuable addition to the literature."" - Mathematics of ComputationAn 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.The 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.Supplementary 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. An anthology of fundamental papers on undecidability and unsolvability, this classic reference 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. 1965 edition. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Bestandsnummer des Verkäufers 9780486432281