Martin Davis: Computer Science Pioneer Dover's publishing relationship with Martin Davis, now retired from NYU and living in Berkeley, goes back to when we reprinted his classic book Computability and Unsolvability, widely regarded as a classic of theoretical computer science. 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.
|Published (Last):||11 June 2016|
|PDF File Size:||7.14 Mb|
|ePub File Size:||9.53 Mb|
|Price:||Free* [*Free Regsitration Required]|
Goodreads helps you keep track of books you want to read. Want to Read saving…. Want to Read Currently Reading Read. Other editions. Enlarge cover. Error rating book. Refresh and try again. Open Preview See a Problem? Details if other :. Thanks for telling us about the problem. Return to Book Page. Preview — Computability and Unsolvability by Martin D.
Computability and Unsolvability by Martin D. Classic text considers general theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, computable functionals, classification of unsolvable decision problems and more.
Get A Copy. Paperback , pages. Published December 1st by Dover Publications first published More Details Original Title. Other Editions 5. Friend Reviews.
To see what your friends thought of this book, please sign up. To ask other readers questions about Computability and Unsolvability , please sign up. Be the first to ask a question about Computability and Unsolvability. Lists with This Book.
Community Reviews. Showing Average rating 3. Rating details. More filters. Sort order. Start your review of Computability and Unsolvability. May 11, Roberto Rigolin F Lopes rated it really liked it.
We are in , Davis is writing from the border between mathematics and computer science. Non-mathematicians like myself might get scared with the notation e. Then he goes incrementally showing operations with computable functions, recursiv We are in , Davis is writing from the border between mathematics and computer science. Then he goes incrementally showing operations with computable functions, recursive functions and difficulties with decision problems.
One proof after another. The cross-references among the several theorems in this book will make you behave like a Turing machine going furiously back and forth trying to "compute" this book. A great challenge indeed. Lucio Torre rated it really liked it Jan 30, Mattias Lundell rated it it was ok Apr 05, Lucky Bro rated it really liked it Mar 02, Steven Ericsson-Zenith rated it it was amazing Oct 31, Bo Peng rated it it was amazing Nov 20, Chris Hansen rated it it was amazing Jun 11, John rated it really liked it Jan 22, Yitzchok Pinkesz rated it it was amazing Dec 30, Sheffielder rated it it was amazing Mar 26, Kyle Thompson rated it it was ok Nov 02, Sean rated it really liked it Dec 26, Deon rated it really liked it Jul 04, Lewis Cawthorne rated it liked it Jun 28, Oscar Michel rated it really liked it Oct 17, Mattia rated it really liked it Apr 07, Charles rated it liked it Aug 11, Amy Quispe rated it liked it Apr 22, Denis rated it it was amazing Nov 27, John Smith rated it really liked it Jul 20, Nuno rated it liked it Dec 08, Daniel Lam rated it it was amazing Jun 12, Patrick Whittle added it Feb 25, Mark added it Dec 02, Ryan added it Feb 18, Michael added it May 25, Leo Horovitz added it Oct 12, Victor Lagerkvist added it Nov 29, Philomath added it Apr 10, David Scarratt marked it as to-read Jul 26, Jim Fowler added it Nov 03, Ron marked it as to-read Jan 08, Justin Mathews added it May 17, Kyle marked it as to-read Jul 15, Encoder1 added it Aug 21, Aaron Dalton marked it as to-read Sep 11, Ernesto Herrera marked it as to-read Sep 12, Shirley marked it as to-read Oct 29, Marcell Mars added it Jan 06, Jakob marked it as to-read Jan 17, Ed marked it as to-read Jan 29, Daniel added it Jan 31, Chris marked it as to-read Feb 07, There are no discussion topics on this book yet.
Readers also enjoyed. Goodreads is hiring! If you like books and love to build cool products, we may be looking for you. About Martin D. Martin D. Books by Martin D. Related Articles. There are many ways to take action against racism. Read more Trivia About Computability and No trivia or quizzes yet. Welcome back. Just a moment while we sign you in to your Goodreads account.
Martin David Davis
Computability and Unsolvability
The Basic Library List Committee strongly recommends this book for acquisition by undergraduate mathematics libraries. This edition of the classic Computability and Unsolvability is a reprint of the edition with an added appendix. Computabiity, the theory of recursive functions, is a branch of mathematics that focuses on the existence of effective computational procedures. The foundation of the field by Alan Turing, Alonzo Church, and Emil Post occurred before the advent of electronic digital computers. In fact the computer in those days was a human. Matin Davis, who has made fundamental contributions to the field, was influenced by Post as an undergraduate at City College of New York, and received his Ph.