Computability and Unsolvability by Martin Davis

Computability and Unsolvability by Martin Davis

In this classic text, Dr. Davis provides a clear introduction to computability, at an advanced undergraduate level, that serves the needs of specialists and non-specialists alike.
In Part One (Chapters 1-5), Professor Davis outlines the general theory of computability, discussing such topics as computable functions, operations on computable functions, recursive functions, Turing machines, self-applied, and unsolvable decision problems. The author has been careful, especially in the first seven chapters, to assume no special mathematical training on the part of the reader.
Part Two (Chapters 6-8) comprises a concise treatment of applications of the general theory, incorporating material on combinatorial problems, Diophantine Equations (including Hilbert's Tenth Problem) and mathematical logic. The final three chapters (Part 3) present further development of the general theory, encompassing the Kleene hierarchy, computable functionals, and the classification of unsolvable decision problems.
When first published in 1958, this work introduced much terminology that has since become standard in theoretical computer science. Indeed, the stature of the book is such that many computer scientists regard it as their theoretical introduction to the topic. This new Dover edition makes this pioneering, widely admired text available in an inexpensive format.
For Dover's edition, Dr. Davis has provided a new Preface and an Appendix, -Hilbert's Tenth Problem Is Unsolvable, - an important article he published in The American Mathematical Monthly in 1973, which was awarded prizes by the American Mathematical Society and the Mathematical Association of America. These additions further enhance the value and usefulness of an -unusually clear and stimulating exposition- (Centre National de la Recherche Scientifique, Paris) now available for the first time in paperback.

Martin Davis, a renowned prize-winning logician, has dedicated more than six decades of his life to the crucial intersection of logic and computer science. He was born in New York City and obtained his Ph.D. from Columbia University. In 1950, he graduated from Princeton University. He worked for thirty years at New York University, where he was instrumental in the establishment of the computer science department. His knowledge, combined with his genuine enthusiasm for the subject and exceptional narrative skills, make him the ideal person to tell this story. Professor Davis is now Professor Emeritus at New York University and resides in Berkeley, California, with his 66-year-old wife.

SKU	Unavailable
ISBN 13	9780486614717
ISBN 10	0486614719
Title	Computability and Unsolvability
Author	Martin Davis
Series	Dover Books On Computer Science
Condition	Unavailable
Binding Type	Paperback
Publisher	Dover Publications Inc.
Year published	2003-03-28
Number of pages	288
Cover note	Book picture is for illustrative purposes only, actual binding, cover or edition may vary.