Martin D. Davis

Frontiers Comput. Sci., 2021

2020

Seventy Years of Computer Science.

[BibT_eX]

[DOI]

Proceedings of the Fields of Logic and Computation III, 2020

2018

Turing's Vision and Deep Learning.

[BibT_eX]

[DOI]

Proceedings of the Sailing Routes in the World of Computation, 2018

2016

Concluding Comments by Martin.

[BibT_eX]

[DOI]

Proceedings of the Martin Davis on Computability, 2016

Pragmatic Platonism.

[BibT_eX]

[DOI]

Proceedings of the Martin Davis on Computability, 2016

My Life as a Logician.

[BibT_eX]

[DOI]

Proceedings of the Martin Davis on Computability, 2016

Algorithms, Equations, and Logic.

[BibT_eX]

[DOI]

Proceedings of the Once and Future Turing: Computing the World, 2016

2014

Logic and the development of the computer.

[BibT_eX]

[DOI]

Proceedings of the Computational Logic, 2014

2009

Sex and the mathematician: The High School Prom Theorem.

[BibT_eX]

[DOI]

Games Econ. Behav., 2009

Diophantine Equations and Computation.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation, 8th International Conference, 2009

2008

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.

[BibT_eX]

[DOI]

Am. Math. Mon., 2008

2007

SAT: Past and Future.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

2006

Why there is no such discipline as hypercomputation.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2006

The Church-Turing Thesis: Consensus and Opposition.

[BibT_eX]

[DOI]

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

An Appreciation of Bob Paige.

[BibT_eX]

[DOI]

High. Order Symb. Comput., 2005

What did Gödel believe and when did he believe it?

[BibT_eX]

[DOI]

Bull. Symb. Log., 2005

Christos Papadimitriou, Turing: A Novel About Computation, MIT Press (2003).

[BibT_eX]

[DOI]

Artif. Intell., 2005

2001

The Early History of Automated Deduction.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Automated Reasoning (in 2 volumes), 2001

1995

American logic in the 1920s.

[BibT_eX]

[DOI]

Bull. Symb. Log., 1995

1991

A Free Variable Version of the First-Order Predicate Calculus.

[BibT_eX]

[DOI]

Ronald Fechter

J. Log. Comput., 1991

1989

Emil Post's Contributions to Computer Science

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1988

Meeting of the Association for Symbolic Logic: New York City, May 1987.

[BibT_eX]

[DOI]

Rohit Parikh

J. Symb. Log., 1988

Metric Space- Based Test-Data Adequacy Criteria.

[BibT_eX]

[DOI]

Comput. J., 1988

1986

Meeting of the Association for Symbolic Logic: Washington, D. C., 1985.

[BibT_eX]

[DOI]

E. G. K. López-Escobar

Wilfried Sieg

J. Symb. Log., 1986

1983

A Formal Notion of Program-Based Test Data Adequacy

[BibT_eX]

[DOI]

Inf. Control., 1983

Computability, complexity, and languages - fundamentals of theoretical computer science.

[BibT_eX]

Computer science and applied mathematics, Academic Press, ISBN: 978-0-12-206380-0, 1983

1982

Introduction

[BibT_eX]

[DOI]

Carl Smith

Paul Young

Inf. Control., 1982

Why Gödel Didn't Have Church's Thesis

[BibT_eX]

[DOI]

Inf. Control., 1982

1981

Obvious Logical Inferences.

[BibT_eX]

[DOI]

Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981

Pseudo-oracles for non-testable programs.

[BibT_eX]

[DOI]

Proceedings of the ACM 1981 Annual Conference, Los Angeles, CA, USA, November 9-11, 1981., 1981

1980

The Mathematics of Non-Monotonic Reasoning.

[BibT_eX]

[DOI]

Artif. Intell., 1980

1966

Meeting of the Association for Symbolic Logic.

[BibT_eX]

[DOI]

J. Symb. Log., 1966

1962

A machine program for theorem-proving.

[BibT_eX]

[DOI]

George Logemann

Donald W. Loveland

Commun. ACM, 1962

1960

A Computing Procedure for Quantification Theory.

[BibT_eX]

[DOI]

Hilary Putnam

J. ACM, 1960

1958

Reductions of Hilbert's Tenth Problem.

[BibT_eX]

[DOI]

Hilary Putnam

J. Symb. Log., 1958

Computability and Unsolvability.

[BibT_eX]

McGraw-Hill Series in Information Processing and Computers, McGraw-Hill, 1958

1953

Arithmetical Problems and Recursively Enumerable Predicates.

[BibT_eX]

[DOI]