"Sinopsis" puede pertenecer a otra edición de este libro.
"Sobre este título" puede pertenecer a otra edición de este libro.
Gastos de envío:
EUR 3,73
A Estados Unidos de America
Descripción Condición: New. Brand New. Nº de ref. del artículo: 0486432289
Descripción Condición: New. Nº de ref. del artículo: 1717233-n
Descripción Paperback or Softback. Condición: New. The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions 1.16. Book. Nº de ref. del artículo: BBS-9780486432281
Descripción Condición: New. Brand New! Not Overstocks or Low Quality Book Club Editions! Direct From the Publisher! We're not a giant, faceless warehouse organization! We're a small town bookstore that loves books and loves it's customers! Buy from Lakeside Books!. Nº de ref. del artículo: OTF-S-9780486432281
Descripción Paperback. Condición: new. New. Fast Shipping and good customer service. Nº de ref. del artículo: Holz_New_0486432289
Descripción Paperback. Condición: New. Brand New! This item is printed on demand. Nº de ref. del artículo: 0486432289
Descripción Paperback. Condición: 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. Nº de ref. del artículo: 9780486432281
Descripción Condición: New. Nº de ref. del artículo: I-9780486432281
Descripción Paperback. Condición: new. New Copy. Customer Service Guaranteed. Nº de ref. del artículo: think0486432289
Descripción Condición: New. Book is in NEW condition. Nº de ref. del artículo: 0486432289-2-1