default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin D. Davis
2020 – today
- 2021
[j22]Martin Davis:
The Brain-As-Computer Metaphor. Frontiers Comput. Sci. 3: 681416 (2021)- 2020
- [c8]Martin Davis:
Seventy Years of Computer Science. Fields of Logic and Computation III 2020: 105-117
2010 – 2019
- 2018
- [c7]Martin Davis:
Turing's Vision and Deep Learning. CiE 2018: 146-155 - 2016
- [p5]Martin Davis:
Algorithms, Equations, and Logic. 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 - [p2]Martin Davis:
Concluding Comments by Martin. Martin Davis on Computability, Computational Logic, and Mathematical Foundations 2016: 357-362 - 2015
- [e1]Martin Davis, Ansgar Fehnker
, Annabelle McIver, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning - 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings. Lecture Notes in Computer Science 9450, Springer 2015, ISBN 978-3-662-48898-0 [contents] - 2014
- [r1]Martin Davis:
Logic and the development of the computer. Computational Logic 2014: 31-38
2000 – 2009
- 2009
- [j21]Martin Davis:
Sex and the mathematician: The High School Prom Theorem. Games Econ. Behav. 66(2): 600 (2009) - [c6]Martin Davis:
Diophantine Equations and Computation. UC 2009: 4-5 - 2008
- [j20]Martin Davis:
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. Am. Math. Mon. 115(3): 270-275 (2008) - 2007
- [c5]Martin Davis:
SAT: Past and Future. SAT 2007: 1-2 - 2006
- [j19]Martin Davis:
Why there is no such discipline as hypercomputation. Appl. Math. Comput. 178(1): 4-7 (2006) - [c4]Martin Davis:
The Church-Turing Thesis: Consensus and Opposition. CiE 2006: 125-132 - 2005
- [j18]Martin D. Davis:
Christos Papadimitriou, Turing: A Novel About Computation, MIT Press (2003). Artif. Intell. 169(2): 209-210 (2005) - [j17]Martin Davis:
What did Gödel believe and when did he believe it? Bull. Symb. Log. 11(2): 194-206 (2005) - [j16]Martin Davis:
An Appreciation of Bob Paige. High. Order Symb. Comput. 18(1-2): 13-13 (2005) - 2001
- [p1]Martin Davis:
The Early History of Automated Deduction. Handbook of Automated Reasoning 2001: 3-15
1990 – 1999
- 1995
- [j15]Martin Davis:
American logic in the 1920s. Bull. Symb. Log. 1(3): 273-278 (1995) - 1991
- [j14]Martin Davis, Ronald Fechter:
A Free Variable Version of the First-Order Predicate Calculus. J. Log. Comput. 1(4): 431-451 (1991)
1980 – 1989
- 1989
- [c3]Martin Davis:
Emil Post's Contributions to Computer Science. LICS 1989: 134-136 - 1988
- [j13]Martin D. Davis, Elaine J. Weyuker:
Metric Space- Based Test-Data Adequacy Criteria. Comput. J. 31(1): 17-24 (1988) - [j12]Martin Davis, Rohit Parikh:
Meeting of the Association for Symbolic Logic: New York City, May 1987. J. Symb. Log. 53(4): 1270-1274 (1988) - 1986
- [j11]Martin Davis, E. G. K. López-Escobar, Wilfried Sieg:
Meeting of the Association for Symbolic Logic: Washington, D. C., 1985. J. Symb. Log. 51(4): 1085-1092 (1986) - 1983
- [b2]Martin D. Davis, Elaine J. Weyuker:
Computability, complexity, and languages - fundamentals of theoretical computer science. Computer science and applied mathematics, Academic Press 1983, ISBN 978-0-12-206380-0, pp. I-XIX, 1-425 - [j10]Martin D. Davis, Elaine J. Weyuker:
A Formal Notion of Program-Based Test Data Adequacy. Inf. Control. 56(1/2): 52-71 (1983) - 1982
- [j9]Martin Davis, Carl Smith, Paul Young:
Introduction. Inf. Control. 52(1): 1 (1982) - [j8]Martin Davis, Carl Smith, Paul Young:
Introduction. Inf. Control. 54(1/2): 1 (1982) - [j7]Martin Davis:
Why Gödel Didn't Have Church's Thesis. Inf. Control. 54(1/2): 3-24 (1982) - 1981
- [c2]Martin D. Davis, Elaine J. Weyuker:
Pseudo-oracles for non-testable programs. ACM Annual Conference 1981: 254-257 - [c1]Martin Davis:
Obvious Logical Inferences. IJCAI 1981: 530-531 - 1980
- [j6]Martin Davis:
The Mathematics of Non-Monotonic Reasoning. Artif. Intell. 13(1-2): 73-80 (1980)
1960 – 1969
- 1966
- [j5]Martin Davis:
Meeting of the Association for Symbolic Logic. J. Symb. Log. 31(4): 697-706 (1966) - 1962
- [j4]Martin Davis, George Logemann, Donald W. Loveland:
A machine program for theorem-proving. Commun. ACM 5(7): 394-397 (1962) - 1960
- [j3]Martin Davis, Hilary Putnam:
A Computing Procedure for Quantification Theory. J. ACM 7(3): 201-215 (1960)
1950 – 1959
- 1958
- [b1]Martin D. Davis:
Computability and Unsolvability. McGraw-Hill Series in Information Processing and Computers, McGraw-Hill 1958, pp. I-XXV, 1-210 - [j2]Martin Davis, Hilary Putnam:
Reductions of Hilbert's Tenth Problem. J. Symb. Log. 23(2): 183-187 (1958) - 1953
- [j1]Martin Davis:
Arithmetical Problems and Recursively Enumerable Predicates. J. Symb. Log. 18(1): 33-41 (1953)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
