Undecidable basic papers problems von davis martin (27 Ergebnisse)

Paperback. Zustand: Good. "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.…

Paperback. Zustand: Good. "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.…

Zustand: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

paperback. Zustand: 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.

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

Zustand: New.

Zustand: 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.

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

Zustand: As New. Unread book in perfect condition.

paperback. Zustand: Very Good. Most items will be dispatched the same or the next working day. A copy that has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.

Zustand: New.

Paperback. Zustand: New. Brand new book, sourced directly from publisher. Dispatch time is 7-8 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Zustand: Very Good. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Kartoniert. Oktn. Buch.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Taschenbuch. Zustand: 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. …

Kartoniert / Broschiert. Zustand: 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. Zustand: New. In shrink wrap. Looks like an interesting title.

hardcover. Zustand: As New.

Hardcover. Zustand: Very Good. 1st Edition. First Edition. 9.5 x 6.5 in. 440 pp. Red cloth lettered in gilt at spine. No internal markings, small square of off-setting from removed sticker at front pastedown, light rubbing and dust-soiling to boards, small tear to cloth at crown of spine. Very Good.

Hardcover. Zustand: Near Fine. Zustand des Schutzumschlags: 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. Zustand: 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. Zustand: Good. Zustand des Schutzumschlags: very good. First Edition. First Edition. Hardcover in dust jacket, Octavo, 440 pages. Book in good condition; moderate wear to boards including spotting, slight soiling to the edges and a little to the interior. In very good dust jacket with moderate wear and chipping to the head/tail edges and price clipped front flap.Contains the first printing of Emil Post's Absolutely Unsolvable Problems and Relatively Undecidable PropositionsAccount of an Anticipation," where he explains his unpublished parallel work to Godel's incompleteness theorem.…

fester Einband. 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;*. Sprache: Englisch.

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.

Paperback / softback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.