Librería: HPB Inc., Dallas, TX, Estados Unidos de America
EUR 8,01
Cantidad disponible: 1 disponibles
Añadir al carritopaperback. Condición: 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!
Idioma: Inglés
Publicado por Dover Publications, Incorporated, 2004
ISBN 10: 0486432289 ISBN 13: 9780486432281
Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
EUR 14,51
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
Idioma: Inglés
Publicado por Mineola, NY: Dover, 2004, 2004
ISBN 10: 0486432289 ISBN 13: 9780486432281
Librería: Atlantic Bookshop, Brooklyn, NY, Estados Unidos de America
Original o primera edición
EUR 10,68
Cantidad disponible: 1 disponibles
Añadir al carritoSoft cover. Condición: Very Good. 1st Edition. 8vo, card covers, 413pp. VG+: clean, bright and sound.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 16,90
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Dover Publications 2/18/2004, 2004
ISBN 10: 0486432289 ISBN 13: 9780486432281
Librería: BargainBookStores, Grand Rapids, MI, Estados Unidos de America
EUR 19,26
Cantidad disponible: 5 disponibles
Añadir al carritoPaperback or Softback. Condición: New. The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions. Book.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 17,56
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Lakeside Books, Benton Harbor, MI, Estados Unidos de America
EUR 16,74
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondició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!
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 21,36
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Dover Publications Inc., US, 2004
ISBN 10: 0486432289 ISBN 13: 9780486432281
Librería: Rarewaves USA, OSWEGO, IL, Estados Unidos de America
EUR 22,37
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New.
Idioma: Inglés
Publicado por Dover Publications Inc., New York, 2004
ISBN 10: 0486432289 ISBN 13: 9780486432281
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
EUR 23,52
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. 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.
Idioma: Inglés
Publicado por Dover Publications Inc., US, 2004
ISBN 10: 0486432289 ISBN 13: 9780486432281
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
EUR 28,67
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New.
Idioma: Inglés
Publicado por Dover Publications Inc. 2004-02-01, 2004
ISBN 10: 0486432289 ISBN 13: 9780486432281
Librería: Chiron Media, Wallingford, Reino Unido
EUR 21,42
Cantidad disponible: 20 disponibles
Añadir al carritoPaperback. Condición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 24,01
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Antiquariat Stefan Krüger, Essen, NRW, Alemania
EUR 22,00
Cantidad disponible: 1 disponibles
Añadir al carritoKartoniert. Oktn. Buch.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 24,84
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Dover Publications Inc., US, 2004
ISBN 10: 0486432289 ISBN 13: 9780486432281
Librería: Rarewaves USA United, OSWEGO, IL, Estados Unidos de America
EUR 24,03
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New.
Librería: moluna, Greven, Alemania
EUR 24,71
Cantidad disponible: Más de 20 disponibles
Añadir al carritoKartoniert / Broschiert. Condición: New. Über den AutorrnrnMartin Davis: Computer Science PioneernDover 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 Unsolvabili.
Librería: BennettBooksLtd, Los Angeles, CA, Estados Unidos de America
EUR 73,39
Cantidad disponible: 1 disponibles
Añadir al carritopaperback. Condición: New. In shrink wrap. Looks like an interesting title!
Idioma: Inglés
Publicado por Dover Publications Feb 2004, 2004
ISBN 10: 0486432289 ISBN 13: 9780486432281
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 30,62
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware - 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.
Idioma: Inglés
Publicado por Dover Publications Inc., US, 2004
ISBN 10: 0486432289 ISBN 13: 9780486432281
Librería: Rarewaves.com UK, London, Reino Unido
EUR 25,89
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New.
Idioma: Inglés
Publicado por Dover Publications Inc., 2004
ISBN 10: 0486432289 ISBN 13: 9780486432281
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 24,36
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Idioma: Inglés
Publicado por Dover Publications Inc., New York, 2004
ISBN 10: 0486432289 ISBN 13: 9780486432281
Librería: AussieBookSeller, Truganina, VIC, Australia
EUR 33,90
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. 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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Idioma: Inglés
Publicado por Dover Publications Inc., New York, 2004
ISBN 10: 0486432289 ISBN 13: 9780486432281
Librería: CitiRetail, Stevenage, Reino Unido
EUR 31,01
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.