Resultado de búsqueda
[2] Davis, Martin D., Sigal, Ron, Weyuker, Elaine J., Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science, Second Edition, Academic Press,1994.
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.
Gödel's Theorem & Artificial Intelligence (Two short papers refuting Roger Penrose from Behavioral and Brain Science) Is Mathematical Insight Algorithmic? postscript How Subtle is Gödel's Theorem postscript
The Once and Future Turing 2016: 4-19. [p4] Martin Davis: My Life as a Logician. Martin Davis on Computability, Computational Logic, and Mathematical Foundations 2016: 1-33. [p3] Martin Davis: Pragmatic Platonism. Martin Davis on Computability, Computational Logic, and Mathematical Foundations 2016: 349-356.
About this book. This book presents a set of historical recollections on the work of Martin Davis and his role in advancing our understanding of the connections between logic, computing, and unsolvability. The individual contributions touch on most of the core aspects of Davis’ work and set it in a contemporary context.
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 ...
1 de sept. de 2001 · Author Biography: Martin Davis's other books include Computability and Unsolvability . A professor emeritus at New York University, he is currently a visiting scholar at the University of California-Berkeley.
