undecidable basic papers problems propositions di martin davis (19 risultati)

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!

Condizione: Good. Used book that is in clean, average condition without any missing pages.

Paperback. Condizione: 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!

Paperback. Condizione: 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.

Soft cover. Condizione: Very Good. 1st Edition. 8vo, card covers, 413pp. VG+: clean, bright and sound.

Paperback or Softback. Condizione: New. The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions. Book.

Kartoniert. Oktn. Buch.

Original cloth. Condizione: Very Good. Condizione sovraccoperta: No Dust Jacket. First Edition. Original grey cloth with giltstamped lettering to spine. With ex-library stamps and labels. Slight shelfwear. ; 23.5x15.5x3.3 cm; 440 pages.

Condizione: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.

Condizione: New. &Uumlber 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.

paperback. Condizione: New. In shrink wrap. Looks like an interesting title!

Condizione: good. This item is in overall good condition. Covers and dust jackets are intact but may have minor wear including slight curls or bends to corners as well as cosmetic blemishes including stickers. Pages are intact but may have minor highlighting writing. Binding is intact; however, spine may have slight wear overall. Digital codes may not be included and have not been tested to be redeemable and or active. Minor shelf wear overall. Please note that all items are donated goods and are in used condition. Orders shipped Monday through Friday! Your purchase helps put people to work and learn life skills to reach their full potential. Orders shipped Monday through Friday. Your purchase helps put people to work and learn life skills to reach their full potential. Thank you!

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 out the class of recursive functions as computable by finite algorithms. 1965 edition.

Original Cloth. Condizione: Very Good. Condizione sovraccoperta: Very Good. First Edition. The boards have fading to the spine and along the top edges. Browning to the page edges. The front free endpaper has the name of the original owner along with his College and a reference number - this was Jimmy Altham, a Life Fellow of Gonville & Caius College, and a Professor of Philosophy at the University of Cambridge. The pages are lightly browned but otherwise unmarked. The price-clipped jacket has very slight chipping to the top and bottom of the spine, slight edge wear and a little browning. First printing.

Hardcover. Condizione: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks.

Hardcover. Condizione: Near Fine. Condizione sovraccoperta: Very Good. 1st Edition. 440 Pp. Blue Cloth, Gilt. First Or Early Printing, Book Is 3.2 Cm Thick (An Otherwise Identical Issue In Blue Cloth Is Also 3.2 Cm Thick, But A Later Reprint In Blue Cloth With A Different Typesetting Of Title Page And Completely Different Copyright Page With Isbn And In An Unpriced And Different Dust Jacket Is 2.9 Cm Thick). Slight Usage; Book Near Fine, Dj Priced $9.75, Light Usage, A Few Short Closed Tears At Edges And Minute Losses At Corners. The Book Is An Anthology Of 17 Papers, Most Previously Published, But Including Previously Unpublished Lectures By Godel And An Unpublished Account By Post Of His Early Work, And With Supplementary Material Furnished By Godel And Keene. Signed Bookplate And Also The Name Stamp Of Hal Berghel, Professor Of Computer Science At The University Of Nevada, Las Vegas Where He Has Previously Served As Director Of Both The Schools Of Computer Science And Informatics, And As Associate Dean Of The College Of Engineering. He Created And Directed The First Cybersecurity Degree Programs (Bachelors, Masters And Phd) In Nevada In 2005. He Was The Founding Director Of The Identity Theft And Financial Fraud Research And Operations Center And Cybersecurity Research Center.

Hardcover. Condizione: Near Fine. No Jacket. 1st Edition. 440 Pp. Red Cloth, Gilt. First Or Early Printing, Book Is 3.2 Cm Thick (An Otherwise Identical Issue In Blue Cloth Is Also 3.2 Cm Thick, But A Later Reprint In Blue Cloth With A Different Typesetting Of Title Page And Completely Different Copyright Page With Isbn And In An Unpriced And Different Dust Jacket Is 2.9 Cm Thick). Slight Usage; Book Near Fine, Bumping To Lower Front Tip, No Dut Jacket, No Marks. . The Book Is An Anthology Of 17 Papers, Most Previously Published, But Including Previously Unpublished Lectures By Godel And An Unpublished Account By Post Of His Early Work, And With Supplementary Material Furnished By Godel And Keene.

Hardcover. First Edition; First Printing. Very Good in a Very Good price clipped dust jacket. Lightly cocked spine. Faitn shelf wear on front/rear panels.

440 S. Ln.mS. *Umschlag mit geringen Randläsuren* gutes Expl.* Kurt Gödel, Alonzo Church, Alan M. Turing, J. B. Rosser, Stephen C. Kleene, Emil Post;*.