• Publications
  • Influence
A machine program for theorem-proving
TLDR
The programming of a proof procedure is discussed in connection with trial runs and possible improvements. Expand
  • 3,293
  • 247
  • PDF
A Computing Procedure for Quantification Theory
TLDR
The hope that mathematical methods employed in the investigation of formal logic would lead to purely computational methods for obtaining mathematical theorems goes back to Leibniz and has been revived by Peano around the turn of the century and by Hilbert's school in the 1920's. Expand
  • 2,853
  • 136
  • PDF
Computability and Unsolvability
  • M. Davis
  • Mathematics, Computer Science
  • McGraw-Hill Series in Information Processing and…
  • 1 December 1959
Only for you today! Discover your favourite computability and unsolvability book right here by downloading and getting the soft file of the book. This is not your time to traditionally go to the bookExpand
  • 839
  • 47
  • PDF
Computability, complexity, and languages - fundamentals of theoretical computer science
  • M. Davis, E. Weyuker
  • Mathematics, Computer Science
  • Computer science and applied mathematics
  • 23 September 2014
Preliminaries. Computability: Programs and Computable Functions. Primitive Recursive Functions. A Universal Program. Calculations on Strings. Turing Machines. Processes and Grammars. ClassifyingExpand
  • 300
  • 14
  • PDF
Pseudo-oracles for non-testable programs
The most commonly used method of validating a program is by testing. The programmer typically runs the program on some test cases, and if and when they run correctly, the program is considered to beExpand
  • 78
  • 8
The Early History of Automated Deduction
  • M. Davis
  • Computer Science
  • Handbook of Automated Reasoning
  • 2001
  • 45
  • 7
Arithmetical Problems and Recursively Enumerable Predicates
  • M. Davis
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1 March 1953
  • 61
  • 6
The Mathematics of Non-Monotonic Reasoning
  • M. Davis
  • Computer Science
  • Artif. Intell.
  • 1 April 1980
TLDR
McCarthy attempts to capture an idea inherent in Occam's razor: only those objects should be assumed to exist which are minimally required by the context. Expand
  • 99
  • 3
Why Gödel Didn't Have Church's Thesis
  • M. Davis
  • Mathematics, Computer Science
  • Inf. Control.
  • 1 July 1982
TLDR
To celebrate the occasion of the twentieth anniversary meeting on Foundations of Computer Science, in October 1979, it was held at a very special location, San Juan, Puerto Rico, and three distiguished pioneers of theoretical computer science, Sheila Greibach, Juris Hartmanis, and Stephen C. Kleene were invited to give addresses on the history of the field. Expand
  • 108
  • 3
Metric Space- Based Test-Data Adequacy Criteria
TLDR
Presentation d'un modele theorique pour la notion d'adequation d un programme de test. Expand
  • 17
  • 3