Seventy Years of Computer Science

DOI10.1007/978-3-030-48006-6_8MaRDI QIDQ5049043zbMATH OpenOpenAlexFDO

Authors Martin Davis

Publication date 9 November 2022

Published in Fields of Logic and Computation III (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-48006-6_8

zbMATH Keywords

ACESATTuringcomputabilityuniversalPresburger arithmeticrecursive functionshypercomputationNPneural netCopelandlinked conjunctobvious inferencesORDVACtest data adequacy

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3904558 (Why is no real title available?)
• scientific article; zbMATH DE number 4039834 (Why is no real title available?)
• scientific article; zbMATH DE number 1521550 (Why is no real title available?)
• scientific article; zbMATH DE number 3212023 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• A Machine-Oriented Logic Based on the Resolution Principle
• A formal notion of program-based test data adequacy
• Alan Turing: Life and Legacy of a Great Thinker
• An Implementation of the Model Elimination Proof Procedure
• An improved proof procedure1
• DPLL: the core of modern satisfiability solvers
• Martin Davis on computability, computational logic, and mathematical foundations
• Metric Space-based Test-data Adequacy Criteria
• The early history of automated deduction

Cited in

(1)

• Computing and the National Science Foundation, 1950--2016

This page was built for publication: Seventy Years of Computer Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5049043)