The Undecidable

Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions
Herausgeber: Davis, Martin

• Broschiertes Buch

Produktbeschreibung

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.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Verlag: Dover Publications
• Seitenzahl: 413
• Erscheinungstermin: 18. Februar 2004
• Englisch
• Abmessung: 233mm x 164mm x 22mm
• Gewicht: 740g
• ISBN-13: 9780486432281
• ISBN-10: 0486432289
• Artikelnr.: 22296710

Autorenporträt

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

Inhaltsangabe

Kurt Gödel: On Formally Undecidable Propositions of the Principia
Mathematica and Related Systems; On Undecidable Propositions of Formal
Mathematical Systems, On Intuitionistic Arithmetic and Number Theory, On
the Length of Proofs, Remarks Before the Princeton Bicentennial Conference
of Problems in Mathematics Alonzo Church: An Unsolvable Problem of
Elementary Number Theory, A Note on the Entscheidungsproblem Alan M.
Turing: On Computable Numbers, with an Application to the
Entscheidungsproblem, Systems of Logic Based on Ordinals J. B. Rosser: An
Informal Exposition of Proofs of Gödel's Theorem and Church's Theorem,
Extensions of Some Theorems of Gödel and Church Stephen C. Kleene: General
Recursive Functions of Natural Numbers, Recursive Predicates and
Quantifiers Emil Post: Finite Combinatory Processes, Formulation I;
Recursive Unsolvability of a Problem of Thue, Recursively Enumerable Sets
of Positive Integers and Their Decision Problems, Absolutely Unsolvable
Problems and Relatively Undecidable Propositions-Account of an
Anticipation. Index.