BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

The Undecidable : Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions

The Undecidable : Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions

The Undecidable : Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions Paperback - 2004

by Martin Davis (Editor)

Add to wish list
  • Used
  • very good
  • Paperback
Used - Very good

Description

Dover Publications, Incorporated, 2004. Paperback. Very Good. Disclaimer:May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.Dust jacket quality is not guaranteed.
Ask the seller a question Add to wish list
A$17.58
Free Delivery within USA
Standard delivery: 4 to 8 days
More delivery options
Ships from ThriftBooks (Washington, United States)
Biblio Top Seller
The BIBLIO Guarantee

Details

  • Title The Undecidable : Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions
  • Author Martin Davis (Editor)
  • Binding Paperback
  • Edition Dover Ed
  • Condition Used - Very good
  • Pages 413
  • Volumes 1
  • Language ENG
  • Publisher Dover Publications, Incorporated, Mineola, NY
  • Publication date 2004
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index, Table of Contents
  • Bookseller's Inventory # G0486432289I4N00
  • ISBN 9780486432281 / 0486432289
  • Weight 1.16 lbs (0.53 kg)
  • Dimensions 9.16 x 6.44 x 0.85 in (23.27 x 16.36 x 2.16 cm)
  • Category Mathematics
  • Library of Congress Catalogue Number 2003067180
  • Dewey Decimal Code 511.3
  • Quantity available 1

About ThriftBooks Washington, United States

Biblio member since 2018

From the largest selection of used titles, we put quality, affordable books into the hands of readers

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from ThriftBooks

Reader reviews for The Undecidable : Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

"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 Computation
An 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.

About the author

Martin Davis: Computer Science Pioneer
Dover'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 Unsolvability, widely regarded as a classic of theoretical computer science. A graduate of New York's City College, Davis received his PhD from Princeton in the late 1940s and became one of the first computer programmers in the early 1950s, working on the ORDVAC computer at The University of Illinois. He later settled at NYU where he helped found the Computer Science Department.

Not many books from the infancy of computer science are still alive after several decades, but Computability and Unsolvability is the exception. And The Undecidable is an anthology of fundamental papers on undecidability and unsolvability by major figures in the field including Godel, Church, Turing, Kleene, and Post.

Critical Acclaim for Computability and Unsolvability:
"This book gives an expository account of the theory of recursive functions and some of its applications to logic and mathematics. It is well written and can be recommended to anyone interested in this field. No specific knowledge of other parts of mathematics is presupposed. Though there are no exercises, the book is suitable for use as a textbook." -- J. C. E. Dekker, Bulletin of the American Mathematical Society, 1959

Critical Acclaim for The Undecidable:
"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 Computation

Please wait a moment while we load the requested page.

tracking-