L'édition de cet ISBN n'est malheureusement plus disponible.
Afficher les exemplaires de cette édition ISBNLes informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Frais de port :
EUR 3,73
Vers Etats-Unis
Description du livre Etat : New. Brand New. N° de réf. du vendeur 0486614719
Description du livre Etat : New. N° de réf. du vendeur 439007-n
Description du livre Paperback or Softback. Etat : New. Computability and Unsolvability 0.65. Book. N° de réf. du vendeur BBS-9780486614717
Description du livre Etat : 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!. N° de réf. du vendeur OTF-S-9780486614717
Description du livre Etat : New. N° de réf. du vendeur ABLING22Oct2018170014605
Description du livre Etat : New. Buy with confidence! Book is in new, never-used condition. N° de réf. du vendeur bk0486614719xvz189zvxnew
Description du livre Etat : New. New! This book is in the same immaculate condition as when it was published. N° de réf. du vendeur 353-0486614719-new
Description du livre Paperback. Etat : new. Paperback. 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. Classic graduate-level introduction to theory of computability. Discusses 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, more. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9780486614717
Description du livre Etat : New. N° de réf. du vendeur I-9780486614717
Description du livre Paperback. Etat : new. New. Fast Shipping and good customer service. N° de réf. du vendeur Holz_New_0486614719