Martin Davis
#107,828
Most Influential Person Now
Martin Davis's AcademicInfluence.com Rankings
Martin Daviscomputer-science Degrees
Computer Science
#3981
World Rank
#4187
Historical Rank
Artificial Intelligence
#848
World Rank
#864
Historical Rank
Martin Davismathematics Degrees
Mathematics
#5287
World Rank
#7453
Historical Rank
Measure Theory
#671
World Rank
#914
Historical Rank
Download Badge
Computer Science Mathematics
Martin Davis's Degrees
- PhD Mathematics Princeton University
- Bachelors Mathematics New York University
Similar Degrees You Can Earn
Why Is Martin Davis Influential?
(Suggest an Edit or Addition)Martin Davis's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- A machine program for theorem-proving (2011) (3472)
- A Computing Procedure for Quantification Theory (1960) (3002)
- Computability and Unsolvability (1959) (864)
- Hilbert's Tenth Problem is Unsolvable (1973) (425)
- Applied Nonstandard Analysis (1977) (324)
- The Decision Problem for Exponential Diophantine Equations (1961) (307)
- Computability, complexity, and languages - fundamentals of theoretical computer science (2014) (304)
- The Myth of Hypercomputation (2004) (137)
- Why Gödel Didn't Have Church's Thesis (1982) (114)
- The Mathematics of Non-Monotonic Reasoning (1980) (101)
- A relativity principle in quantum mechanics (1977) (95)
- Pseudo-oracles for non-testable programs (1981) (89)
- Why there is no such discipline as hypercomputation (2006) (74)
- Arithmetical problems and recursively enumerable predicates (1953) (73)
- Logic for Programming, Artificial Intelligence, and Reasoning (2015) (64)
- Eliminating the Irrelevant from Mechanical Proofs (1983) (63)
- Obvious Logical Inferences (1981) (63)
- Mathematical logic and the origin of modern computers (1987) (59)
- The Early History of Automated Deduction (2001) (52)
- Metamathematical extensibility for theorem verifiers and proof-checkers☆ (1979) (45)
- Is mathematical insight algorithmic? (1990) (36)
- How subtle is Gödel's theorem? More on Roger Penrose (1993) (30)
- Global positioning systems (2017) (29)
- Influences of mathematical logic on computer science (1988) (26)
- An explicit diophantine definition of the exponential function (1971) (22)
- Computability and Complexity (2008) (19)
- The Universal Computer (2018) (18)
- A Formal Notion of Program-Based Test Data Adequacy (2015) (18)
- 14 – Abstract Complexity (1994) (17)
- Metric Space- Based Test-Data Adequacy Criteria (1988) (17)
- The Church-Turing Thesis: Consensus and Opposition (2006) (16)
- A Free Variable Version of the First-Order Predicate Calculus (1991) (14)
- Hilbert's 10th Problem (1973) (12)
- CHAPTER 14 – Abstract Complexity (1983) (12)
- Chapter 1 – The Early History of Automated Deduction: Dedicated to the memory of Hao Wang (2001) (11)
- Reductions of Hilbert's tenth problem (1958) (11)
- A First Course in Functional Analysis (1966) (9)
- From Linear Operators to Computational Biology: Essays in Honor of Jacob T. Schwartz (2013) (9)
- First order logic (1993) (9)
- What I Tell You Three Times Is True (2017) (8)
- American Logic in the 1920s (1995) (7)
- Universality Is Ubiquitous (2017) (7)
- Conceptual Confluence in 1936: Post and Turing (2015) (7)
- Regulating the market (2007) (5)
- DIVISION OF MATHEMATICS: ONE EQUATION TO RULE THEM ALL* (1968) (5)
- The joy of infinitesimals J. Keisler’selementary calculus (1978) (5)
- Review: J. W. Addison, S. C. Kleene, A Note on Function Quantification (1958) (4)
- Computability, Computation, and the Real World (2006) (4)
- Gödel's universe (2005) (4)
- Diophantine Sets Over Polynomial Rings (2015) (3)
- Turing's Vision and Deep Learning (2018) (3)
- Review: Clifford Spector, On Degrees of Recursive Unsolvability (1957) (2)
- Review: Hartley Rogers, Godel Numberings of Partial Recursive Functions (1964) (2)
- My Life as a Logician (2016) (2)
- Review: H. G. Rice, Recursive and Recursively Enumerable Orders (1957) (2)
- Selected Papers of Abraham Robinson: Nonstandard Analysis and Philosophy (1982) (2)
- Pragmatic Platonism (2016) (2)
- Sex and the mathematician: The High School Prom Theorem (2009) (2)
- Lecture notes on mathematical logic (1959) (2)
- Emil Post's contributions to computer science (1989) (2)
- Exponential and Trigonometric Functions—From the Book (2003) (1)
- The Decision Problem for Exponential Diophantine Equations. (1970) (1)
- Kurt Gödel: What did Gödel believe and when did he believe it? (2010) (1)
- Diophantine Equations and Computation (2009) (1)
- 4 – A Universal Program (1983) (1)
- Programs and Computable Functions (1994) (1)
- Trends in Logic: Relations with Computer Science (1989) (1)
- Review: John Myhill, Criteria of Constructibility for Real Numbers (1955) (1)
- CHAPTER 5 – Calculations on Strings (1983) (1)
- Review: J. Donald Monk, Mathematical logic (1977) (1)
- 15 – Polynomial-Time Computability (1983) (1)
- 9 – Regular Languages (1994) (1)
- Introduction to the abc conjecture (2016) (1)
- Review: J. C. E. Dekker, J. Myhill, Some Theorems on Classes of Recursively Enumerable Sets (1962) (1)
- From Linear Operators to Computational Biology (2013) (1)
- Mathematics and Design:Yes, But Will it Fly? (2002) (1)
- Review: Kurt Godel, John Dawson, Review of Hahn's Reele Funktionen (1990) (0)
- CHAPTER 15 – Polynomial-Time Computability (1983) (0)
- Formal Number Theory and Computability. A Workbook. By Alec Fisher (1985) (0)
- Church's thesis and representation of grammars (1983) (0)
- Introduction (1982) (0)
- Review: Wilson E. Singletary, A Complex of Problems Proposed by Post (1966) (0)
- The Atlas of Unusual Borders (2020) (0)
- Inexhaustibility: A Non-Exhaustive Treatment by Torkel Franzén; Gödel's Theorem: An Incomplete Guide to Its Use and Misuse by Torkel Franzén (2008) (0)
- 3 – Primitive Recursive Functions (1994) (0)
- Review: Julia Robinson, The Undecidability of Algebraic Rings and Fields (1964) (0)
- Review: Solomon Feferman, Godel's Life and Work (1990) (0)
- Lectures on modern mathematics (1967) (0)
- Student Housing Rights Guide (2002) (0)
- Hilbert's Tenth Problem. By Yuri V. Matiyasevich (2018) (0)
- Computability, 1973-1974 (1974) (0)
- 5 – Calculations on Strings (1983) (0)
- John W. Dawson, Jr.Logical Dilemmas: The Life and Work of Kurt Gödel. (1998) (0)
- Review: Andrzej Mostowski, An Undecidable Arithmetical Statement (1954) (0)
- Completely logical thinking (1988) (0)
- 13 – Quantification Theory (1994) (0)
- Seventy Years of Computer Science (2020) (0)
- Context-Free Languages (1983) (0)
- Review: W. V. Quine, On Decidability and Completeness (1951) (0)
- Concluding Comments by Martin (2016) (0)
- REVIEWS-Super-recursive algorithms (2007) (0)
- CHAPTER 1 – Preliminaries (1983) (0)
- Review: Julia Robinson, General Recursive Functions (1951) (0)
- CHAPTER 6 – Turing Machines (1983) (0)
- CHAPTER 11 – Propositional Calculus (1983) (0)
- Review: J. C. E. Dekker, Two Notes on Recursively Enumerable Sets (1955) (0)
- Review: E. W. Beth, Observations Concerning Computing, Deduction, and Heuristics (1968) (0)
- 6 – Turing Machines (1994) (0)
- Computation, Models, and Sets. An Essay on Wang Hao “Popular Lectures on Mathematical Logic” (1982) (0)
- 18 – Operational Semantics of Recursion Equations (1994) (0)
- Turing Conceives of the All-Purpose Computer: Detour through Infinity (2011) (0)
- Cantor: Detour through Infinity (2018) (0)
- CHAPTER 2 – Programs and Computable Functions (1983) (0)
- Beyond Leibniz’s Dream (2011) (0)
- 12 – Propositional Calculus (1994) (0)
- 10 – Context-Free Languages (1994) (0)
- Algorithms and Recursive Functions (A. I. Mal’cev) (1977) (0)
- 16 – Approximation Orderings (1994) (0)
- Logic and the development of the computer (2014) (0)
- Frege: From Breakthrough to Despair (2018) (0)
- The logician and the engineer - a book review (2013) (0)
- Turing Conceives the All-Purpose Computer (2018) (0)
- Houses that Jack built: Essays in honor of Jack Schwartz (1995) (0)
- Introduction (1982) (0)
- CHAPTER 8 – Regular Languages (1983) (0)
- Making the First Universal Computers (2011) (0)
- Mathematisches Forschungsinstitut Oberwolfach Report No . 3 / 2003 Miniworkshop : Hilbert ’ s Tenth Problem , Mazur ’ s Conjecture and Divisibility Sequences January 19 th – January 25 (2003) (0)
- Review: John Myhill, Finitely Representable Functions (1973) (0)
- Review: Julia Robinson, Recursive Functions of One Variable (1970) (0)
- Review: Alfred Tarski, Undecidable Theories (1959) (0)
- Degrees of Unsolvability and Post's Problem (1983) (0)
- 17 – Denotational Semantics of Recursion Equations (1994) (0)
- Review: Richard Montague, Towards a General Theory of Computability (1964) (0)
- Gödel Upsets the Applecart (2018) (0)
- The greatest of them all : the legend of Bobby Jones : classic photography of the incomparable Bobby Jones (1996) (0)
- 7 – Processes and Grammars (1983) (0)
- CHAPTER 12 – Quantification Theory (1983) (0)
- Primitive Recursive Functions (1983) (0)
- Meeting of the Association for Symbolic Logic, New York City, May 1987 (1988) (0)
- CHAPTER 7 – Processes and Grammars (1983) (0)
- Leibniz’s Dream (2011) (0)
- CHAPTER 13 – Loop Programs (1983) (0)
- Pragmatic Platonism: Mathematics and the Infinite (2018) (0)
- SAT: Past and Future (2007) (0)
- Hilbert to the Rescue (2011) (0)
- 11 – Context-Sensitive Languages (1983) (0)
- Student housing and the law (2008) (0)
- Theoretical and Pragmatic Issues in Software Engineering (1990) (0)
- CHAPTER 16 – Classifying Unsolvable Problems (1983) (0)
- Christos Papadimitriou, Turing: A Novel About Computation, MIT Press (2003) (2005) (0)
- Boole Turns Logic into Algebra (2011) (0)
- Review: Marshall Hall, The Word Problem for Semigroups with Two Generators (1950) (0)
- Gödel Upsets the Applecart: From Breakthrough to Despair (2011) (0)
- Book review: Melvin Fitting. Computability theory, semantics, and logic programming. (1990) (0)
- Ahead of His Time (2006) (0)
- CHAPTER 4 – A Universal Program (1983) (0)
- CHAPTER 10 – Context-Sensitive Languages (1983) (0)
- Integrated teams can deliver more for less (2013) (0)
- Teaching the Incompleteness Theorem (1989) (0)
- Review: Richard L. Epstein and Walter A. Carnielli, Computability; (computable functions, logic, and the foundations of mathematics) (1991) (0)
- Meeting of the Association for Symbolic Ldgic, Washington, DC, 1985 (1986) (0)
- An Appreciation of Bob Paige (2005) (0)
- 8 – Classifying Unsolvable Problems (1983) (0)
This paper list is powered by the following services:
