9780486432281 - the undecidable: basic papers on undecidable propostions, unsolvable problems and computable functions (21 risultati)
- Brossura
Da: HPB Inc., Dallas, TX, U.S.A.HPB Inc.
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Molto buono
EUR 8,00
EUR 3,24 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
paperback. Condizione: 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.
- Brossura
Da: Better World Books, Mishawaka, IN, U.S.A.Better World Books
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Buono
EUR 13,47
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
Condizione: 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.
Altre immagini- Brossura
- Prima edizione
Da: Atlantic Bookshop, Brooklyn, NY, U.S.A.Atlantic Bookshop
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Molto buono
EUR 10,66
EUR 5,18 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Soft cover. Condizione: Very Good. 1st Edition. 8vo, card covers, 413pp. VG+: clean, bright and sound.
- Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 16,87
EUR 2,28 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Brossura
Da: BargainBookStores, Grand Rapids, MI, U.S.A.BargainBookStores
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 19,23
Spedizione gratuitaSpedito in U.S.A.Quantità: 5 disponibili
Paperback or Softback. Condizione: New. The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions. Book.
- Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 17,53
EUR 2,28 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Brossura
Da: Lakeside Books, Benton Harbor, MI, U.S.A.Lakeside Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 16,71
EUR 3,44 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: 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.
- Brossura
Da: California Books, Miami, FL, U.S.A.California Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 21,33
Spedizione gratuitaSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Brossura
Da: Rarewaves USA, OSWEGO, IL, U.S.A.Rarewaves USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 22,33
Spedizione gratuitaSpedito in U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New.
- Brossura
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 23,48
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
Paperback. Condizione: 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 paper…s 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.
- Brossura
Da: Chiron Media, Wallingford, , Regno UnitoChiron Media
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 21,40
EUR 17,93 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 20 disponibili
Paperback. Condizione: New.
- Brossura
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 23,99
EUR 17,36 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Brossura
Da: Antiquariat Stefan Krüger, Essen, NRW, GermaniaAntiquariat Stefan Krüger
Contatta il venditoreVenditore con 3 stelleCondizione: Usato
EUR 22,00
EUR 19,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Kartoniert. Oktn. Buch.
- Brossura
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 24,80
EUR 17,36 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Brossura
Da: Rarewaves USA United, OSWEGO, IL, U.S.A.Rarewaves USA United
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 24,00
EUR 43,13 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New.
- Brossura
Da: moluna, Greven, , Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 24,71
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Kartoniert / Broschiert. Condizione: 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.
- Brossura
Da: BennettBooksLtd, Los Angeles, CA, U.S.A.BennettBooksLtd
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 73,28
EUR 6,00 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
paperback. Condizione: New. In shrink wrap. Looks like an interesting title.
- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 30,62
EUR 63,70 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: 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 ou…t the class of recursive functions as computable by finite algorithms. 1965 edition.
- Brossura
- Print on Demand
Da: THE SAINT BOOKSTORE, Southport, , Regno UnitoTHE SAINT BOOKSTORE
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 24,34
EUR 18,89 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
- Brossura
- Print on Demand
Da: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 33,98
EUR 31,92 spedizioneSpedito da Australia a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: 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 paper…s 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.
- Brossura
- Print on Demand
Da: CitiRetail, Stevenage, Regno UnitoCitiRetail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 30,98
EUR 42,82 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: 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 paper…s 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.
