Martin Davis

Publications47
h-index8
Citations604
Highly Influential Citations20
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • A. Turing
  • 61 Publications • 14,420 Citations
  • A. Turing
  • 13 Publications • 15,684 Citations
  • G. Chaitin
  • 191 Publications • 10,621 Citations
  • G. Kreisel
  • 132 Publications • 3,567 Citations
  • Publications
  • Influence
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions
TLDR
In this work, the deployment of cache coherence is disproved and Leat, the new system for reliable models, is the solution to all of these issues.
View via Publisher
On the number of solutions of Diophantine equations
For any nontrivial set of cardinal numbers _bt, it is shown that there is no algorithm for testing whether or not the number of positive integer solutions of a given polynomial Diophantine equation…
View via Publisher
The Incompleteness Theorem
  • Martin Davis
  • Philosophy
    The Incompleteness Phenomenon
  • 8 October 2018
414 NOTICES OF THE AMS VOLUME 53, NUMBER 4 I n September 1930 in Königsberg, on the third day of a symposium devoted to the foundations of mathematics, the young Kurt Gödel launched his bombshell…
View via Publisher
Review: Corrado Bohm, On a Family of Turing Machines and the Related Programming Language
Review: John McCarthy, A Basis for a Mathematical Theory of Computation, Preliminary Report; John McCarthy, P. Braffort, D. Hirschberg, A Basis for a Mathematical Theory of Computation
Nelson Edward. Internal set theory: a new approach to nonstandard analysis. Bulletin of the American Mathematical Society , vol. 83 (1977), pp. 1165–1198.
View via Publisher
Review: Marvin L. Minsky, Recursive Unsolvability of Post's Problem of "Tag" and other Topics in the Theory of Turing Machines
ONE EQUATION TO RULE THEM ALL
Abstract : The report describes an application of recursive function theory to Hilbert's tenth problem. It is proved that if a particular exhibited diophantine equation has no nontrivial solutions,…
Alan Turing and the Turing Machine.Turing's Analysis of Computability, and Major Applications of it.The Confluence of Ideas in 1936.Turing in the Land of O.Mathematical Logic and the Origin of Modern…
View via Publisher
Extensions and Corollaries of Recent Work on Hilbert's Tenth Problem
Abstract : The theorem that every recursively enumerable set is expon ntial Diophantine is improve ; a sharp form is given of Kleene's (Introduction to Metamathematics, D. Van Nostrand Company, Inc.,…
View via Publisher
...
...