FAQ

List of important publications in theoretical computer science

Known as: Bibliography of theoretical computer science, On Computable Numbers 
This is a list of important publications in theoretical computer science, organized by field. Some reasons why a particular publication might be… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1936-2017
02419362016

Related topics

Related topics

50 relations
AlgorithmAlgorithmic information theoryAutomated theorem provingBlum axioms
(More)

Broader (1)

History of computer science

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
List of important publications in theoretical computer science
Algorithm
Formal verification
Temporal logic
Structured programming
Computational complexity theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Common Sense, The Turing Test, and The Quest for Real AI, Hector Levesque. The MIT Press (2017)
Hector Levesque, a distinguished AI researcher, an AAAI Fellow, etc., etc., surely well known to all readers of this journal, has… (More)
Is this relevant?
2015
2015
On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism
 
Is this relevant?
2012
2012
What is an algorithm?
This may seem to be a strange question to ask just before the Turing Centenary Year, which is now being celebrated by numerous… (More)
Is this relevant?
Review
2012
Review
2012
Some Reflections on Alan Turing ’ s Centenary
We review two of Alan Turing’s chief publications in mathematical logic: the classic 1936 paper On Computable Numbers [9] and the… (More)
Is this relevant?
2011
2011
Truth and Turing: Systems of Logic based on Ordinals We should like to link Turing’s construction in Systems of Logic based on Ordinals on progressions of theories, with some recent similar looking…
  • 2011
We should like to link Turing’s construction in Systems of Logic based on Ordinals on progressions of theories, with some recent… (More)
Is this relevant?
2006
2006
Historical Projects in Discrete Mathematics and Computer Science
In the United States a course in discrete mathematics is a relatively recent addition, within the last 30 or 40 years, to the… (More)
Is this relevant?
2006
2006
On Computable Numbers, with an Application to the Entscheidungsproblem
  • 2006
The "computable" numbers may be described briefly as the real numbers whose expressions as a decimal are calculable by finite… (More)
Is this relevant?
2001
2001
Turing vs. Super-Turing: a Defence of the Church-Turing Thesis
  • 2001
The following section comes from the second chapter of L. Floridi, Philosophy and Computing (London: Routledge, forthcoming). It… (More)
Is this relevant?
1999
1999
The first computer — an ethical concern
T he Second NSF sponsored "Workshop on Teaching Ethics and Comput ing" at the University o f South Florida <http : / /marathon… (More)
Is this relevant?
Highly Cited
1936
Highly Cited
1936
On computable numbers with an application to the Entscheidungsproblem ( Paper read 12 November 1936 ) Universal Turing Machine R . I
  • Universal Turing, Machine R I P
  • 1936
Cryptographers agree that homogeneous archetypes are an interesting new topic in the field of software engineering, and… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?