US$13.19 con 22 porcentaje de ahorro
Precio recomendado: US$16.95
El Precio listado es el precio de venta sugerido de un nuevo producto tal como lo proporciona un fabricante, proveedor o vendedor. Excepto para los libros, Amazon mostrará un Precio listado si los clientes compraron el producto en Amazon o si otros minoristas lo ofrecieron al Precio listado o a un precio superior al menos en los últimos 90 días. Los precios listados pueden no reflejar necesariamente el precio de mercado actual del producto.
Más información
Devoluciones internacionales gratis
Sin cargos de importación y US$7.29 de envío a Canadá Detalles

Detalles de envío y tarifa

Precio US$13.19
Envío de AmazonGlobal US$7.29
Cargos estimados de importación US$0.00
Total US$20.48

Entrega el martes, 1 de octubre. Realiza el pedido en 44 mins
Sólo hay 12 disponible(s).
US$US$13.19 () Incluye las opciones seleccionadas. Incluye el pago mensual inicial y las opciones seleccionadas. Detalles
Precio
Subtotal
US$US$13.19
Subtotal
Desglose inicial del pago
Se muestran los gastos de envío, la fecha de entrega y el total del pedido (impuestos incluidos) al finalizar la compra
Enviado por
Amazon.com
Enviado por
Amazon.com
Vendido por
Amazon.com
Vendido por
Amazon.com
Devoluciones
Reintegro o reemplazo en 30 días
Reintegro o reemplazo en 30 días
Este artículo se puede devolver en su estado original para obtener un reintegro o reemplazo completo dentro de los 30 días posteriores a la recepción.
Lea la política de devoluciones completa
Devoluciones
Reintegro o reemplazo en 30 días
Este artículo se puede devolver en su estado original para obtener un reintegro o reemplazo completo dentro de los 30 días posteriores a la recepción.
Lea la política de devoluciones completa
Pago
Transacción segura
Tu transacción es segura
En Amazon, nos esforzamos por proteger tu seguridad y privacidad. Nuestro sistema de seguridad de pagos encripta tu información durante la transmisión de datos. No compartimos los datos de tu tarjeta de crédito con vendedores externos, ni vendemos tu información a terceros. Más información
Pago
Transacción segura
En Amazon, nos esforzamos por proteger tu seguridad y privacidad. Nuestro sistema de seguridad de pagos encripta tu información durante la transmisión de datos. No compartimos los datos de tu tarjeta de crédito con vendedores externos, ni vendemos tu información a terceros. Más información
Agregado a

Lo sentimos; hubo un problema.

Hubo un error al recuperar tus Listas de Deseos. Por favor inténtalo de nuevo.

Lo sentimos; hubo un problema.

Lista no disponible.
Imagen del logotipo de la aplicación Kindle

Descarga la app de Kindle gratis y comienza a leer libros Kindle al instante desde tu smartphone, tablet o computadora, sin necesidad de ningún dispositivo Kindle.

Lee al instante desde tu navegador con Kindle para la web.

Usando la cámara de tu celular escanea el siguiente código y descarga la aplicación Kindle.

Código QR para descargar la App Kindle

Seguir al autor

Martin Davis
Seguir
Ocurrió un error. Intenta realizar tu solicitud de nuevo más tarde.

Computability and Unsolvability

de Prof. Martin Davis (Author)
4.4 4.4 de 5 estrellas 26 calificaciones
Ver todos los formatos y ediciones
{"desktop_buybox_group_1":[{"displayPrice":"US$13.19","priceAmount":13.19,"currencySymbol":"US$","integerValue":"13","decimalSeparator":".","fractionalValue":"19","symbolPosition":"left","hasSpace":false,"showFractionalPartIfEmpty":true,"offerListingId":"5Knrd4yOjQcHw%2BfLwQh2YF3xa%2BgnW1dGsWlfQvGZefnmvTgv33RF0hr5MhiuWkBl066W6uu4za4B2FZvwUa9DzwDBemqdT7OexqvoX4gNhBOO9BR07hECDmTrY6NsK%2BU99NtMW2yErM%3D","locale":"es-US","buyingOptionType":"NEW","aapiBuyingOptionIndex":0}]}

Opciones de compra y productos Add-on

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.
Diapositiva anterior de detalles del producto
  1. ISBN-10
    0486614719
  2. ISBN-13
    978-0486614717
  3. Editorial
    Dover Publications
  4. Fecha de publicación
    1 Diciembre 1985
  5. Parte de la serie
    Dover Books on Computer Science
  6. Idioma
    Inglés
  7. Dimensiones
    5.43 x 0.59 x 8.46 pulgadas
  8. Número de páginas
    248 páginas
  9. Ver todos los detalles
Siguiente diapositiva de detalles del producto

Los clientes que compraron este producto también compraron

Página 1 de 1 Comenzar de nuevoPágina 1 de 1
Previous page
  1. Computability and Logic
  2. The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions (Dover Books on Mathe
  3. The Annotated Gödel: A Reader's Guide to his Classic Paper on Logic and Incompleteness
  4. The Universal Computer: The Road from Leibniz to Turing
  5. Introductory Discrete Mathematics (Dover Books on Computer Science)
  6. Naive Set Theory (Dover Books on Mathematics)
Next page

Opiniones editoriales

Biografía del autor

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

Detalles del producto

  • Editorial ‏ : ‎ Dover Publications (1 Diciembre 1985)
  • Idioma ‏ : ‎ Inglés
  • Tapa blanda ‏ : ‎ 248 páginas
  • ISBN-10 ‏ : ‎ 0486614719
  • ISBN-13 ‏ : ‎ 978-0486614717
  • Dimensiones ‏ : ‎ 5.43 x 0.59 x 8.46 pulgadas
  • Opiniones de clientes:
    4.4 4.4 de 5 estrellas 26 calificaciones

Sobre el autor

Sigue a los autores para recibir notificaciones de sus nuevas obras, así como recomendaciones mejoradas.
Martin Davis

Martin Davis

Brief content visible, double tap to read full content.
Full content visible, double tap to read brief content.

Descubre más de los libros del autor, mira autores similares, lee blogs del autor y más

Opiniones de clientes

4.4 de 5 estrellas
26 calificaciones globales

Opiniones destacadas de los Estados Unidos

Traducir todas las opiniones al Español
Man Kam Tam
5.0 de 5 estrellas Mathematics and Computer Science
Calificado en Estados Unidos el 25 de mayo de 2008
Compra verificada
Martin Davis' "Computability and Un-solvability" has been used as the textbook of a graduate course offered by the author at the University of Illinois and a series of lectures at Bell Telephone Laboratories. The style of the book is mathematically formal. Its primary elements are definitions, lemmas, theorems, and proofs. For the readers, who are pursuing to understand more about the Hilbert's tenth problem, algorithm, and recursively enumerable sets, would find this book interesting. The first five chapters are about the general theory of computability, which is the concern of the existence of algorithm--purely mechanical procedures for solving various problems (no creative thought is needed while executing the procedure). First of all, the author introduces Turing machines (A Turing machine is a finite (nonempty) set of quadruples that contains no two quadruples whose first two symbols are the same). Then Davis introduces the definition of the computation of a Turing machine (a finite sequence of instantaneous description of a Turing machine), symbolic representation for numbers (5=SiSiSiSiSi), partially computable functions (the existence of a Turing machine whose resultant is equivalent to f(x1,x2,...,xn), computable functions (f(x1,x2,...,xn) is a total function), recursive functions (a function can be obtained by a finite number of applications of composition and minimalization of regular functions), and unsolvable decision problems (the non-existence of an algorithm for deciding the truth or falsity of whole class of statements). Chapter 6 to chapter 8 are about the applications of the general theory of computability, which includes the applications on combinatorial problems, Diophantine Equations (Hilbert's tenth problem is recursively unsolvable.), and mathematical logic (incompleteness and un-solvability theorems for logics). A glimpse of the "decisive limitation on the power of logics" (Godel's famous incompleteness theorem) is also presented. Chapter 9 to chapter 11 is about the further development of the general theory of computability. There are two appendixes related to mathematics. The first appendix is the fundamental facts of the elementary number theory. The second appendix is the author's paper "Hilbert's Tenth problem is unsolvable." The readers would need a clear concept on computable functions, effectively calculable functions, and algorithm to understand both the general theory of computability and the Hilbert's Tenth problem.
A 7 personas les resultó útil
Útil
 Reportar
Dennis Hamilton
4.0 de 5 estrellas Mapping the Outer Limits of Computation
Calificado en Estados Unidos el 7 de septiembre de 2000
Compra verificada
The book introduces the theory of computability and non-computability to the mathematically-comfortable. The theory of recursive functions provides entry to that theoretical territory at the limits of what is computable and what is solvable. The theory is relevant to important philosophical questions and also in the theory of computing and what is possible (and never possible) by use of computing machines.
The result for philosophy is establishment of absolutely unsolvable problems and undecidable questions, even ones that can be completely and precisely formulated using rigorous logic. The result for computing is problems that are absolutely unsolvable by use of a computer program.
So what problems are theoretically solvable by a computer program? First, the Universal Turing Machine (UTM) is presented along with the famous demonstration that all universal computers are equivalent in the sense that any one of them can be made to simulate any of the others, using a suitable representation.
So, if we establish that the computer we have at hand is a universal computer, we can be confident that, in principle, anything that any computer can compute, this one can also.
The book goes on to address what even universal computers can't do. The most well-known result in computer-science circles is the unsolvability of the halting problem. That is, if the computer is powerful enough to be universal, one of its limitations is the impossibility of an algorithm that will determine whether any program for that machine will always terminate for all inputs. It is as if the price of universality is the inevitability of programs that won't finish, along with having no absolute way of telling whether arbitrary given programs will finish or not.
Davis maps the boundary between the impossible (the unsolvable) and the merely inhumanly difficult (the computable). With that foundation, one can move on to other work that introduces what has been learned about computational complexity and how to apply the analysis of algorithms to finding computational methods that are practical and no more complex than absolutely necessary.
The book is an essential part of my library because of its availability and its standing as a fundamental reference in the theory of computation. Church's Thesis and the development of effective computability via the lambda-calculus and combinatory logic is neglected more than suits me. Available supplementary references are needed for access to those alternative formulations that promise to bear directly on having operational, practical computer systems that function at the limits of computability.
A 75 personas les resultó útil
Útil
 Reportar
Alex Grigoras
5.0 de 5 estrellas Great, but a bit on the formal side
Calificado en Estados Unidos el 30 de noviembre de 2014
Compra verificada
This book did a very good job treating various aspects of computability. I found it extremely theoretical and formal, which is exactly what it set out to be.
However, I think that what it lacks are less formal comments to accompany the heavy formalised theorems. I often found myself asking 'But what does this mean?' after reading the proof of a theorem. While it does give some plain English explanations, I would have liked it to have more. I cannot take away any stars because of this, due to the fact that it is 'advertised' as a technical book, not a philosophical one.
Útil
 Reportar
Roger Bagula
3.0 de 5 estrellas no real examples
Calificado en Estados Unidos el 27 de septiembre de 2009
Two things about this book that I dislike are the notation
and how there are no concrete examples.
There are some subjects or named topics that aren't covered
in some of the other texts which make the book useful.
The basic Thue type substitution system:
0->01
1->10
is defined, but this basic example isn't given?
The Kleene Hierarchy or arithmetic hierarchy is mentioned,
but concrete real world examples are not given.
So there are good and bad things about the book:
I wouldn't try to teach from this text as cheap as it is
being a Dover book, but I might site it as a reference
for students to look into.
A 2 personas les resultó útil
Útil
 Reportar
T. Fan
5.0 de 5 estrellas Good book quick delivery
Calificado en Estados Unidos el 25 de enero de 2022
Compra verificada
a very good book, quick delivery.
Útil
 Reportar
Ericsson-Zenith, Steven
5.0 de 5 estrellas Martin Davis rocks!!
Calificado en Estados Unidos el 1 de mayo de 2017
Compra verificada
A wonderful treatise on the limits of current theory by my dear friend Professor Martin Davis, one of the very best mathematicians alive today and dealing with computation.
A una persona le resultó útil
Útil
 Reportar

Opiniones más destacadas de otros países

Traducir todas las opiniones al Español
Never the Twain
3.0 de 5 estrellas Not readable
Calificado en el Reino Unido el 30 de diciembre de 2019
Compra verificada
This is a mathematical overview of computability. It is not a book about computability. I am a keen graduate student of mathematical aspects of computing, including computability, but I struggled at several places in this book.
Reportar