Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Computability theory

Known as: Recursion theory, Turing computability, Theory of computability 
Computability theory, also called recursion theory, is a branch of mathematical logic, of computer science, and of the theory of computation that… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2002
Highly Cited
2002
From the Publisher: This book contains invited lectures and refereed talks presented at the First International Conference on… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
1. The Self-Reducibility Technique.- 2. The One-Way Function Technique.- 3. The Tournament Divide and Conquer Technique.- 4. The… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
  • R. Soare
  • Bull. Symb. Log.
  • 1996
  • Corpus ID: 5894394
We consider the informal concept of “computability” or “effective calculability” and two of the formalisms commonly used to… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
  • Ming Li, P. Vitányi
  • Handbook of Theoretical Computer Science, Volume…
  • 1990
  • Corpus ID: 34425621
Publisher Summary This chapter focuses on Kolmogorov complexity and its applications. The mathematical theory of Kolmogorov… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
The use of conventional classical logic is misleading for characterizing the behavior of logic programs because a logic program… Expand
Is this relevant?
Highly Cited
1984
Highly Cited
1984
A general theory of public-key cryptography is developed that is based on the mathematical framework of complexity theory. Two… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
  • G. Longo
  • Ann. Pure Appl. Log.
  • 1983
  • Corpus ID: 2899047
On introduit les termes du λ-calcul et les termes de la logique combinatoire d'ordres divers, correspondant aux niveaux de… Expand
Is this relevant?
Highly Cited
1980
Highly Cited
1980
Preface Prologue, prerequisites and notation 1. Computable functions 2. Generating computable functions 3. Other approaches to… Expand
Is this relevant?
Highly Cited
1977
Highly Cited
1977
1. Beginning Mathematical Logic. 2. First-Order Logic. 3. First-Order Logic (continued). 4. Boolean Algebras. 5. Model Theory. 6… Expand
Is this relevant?
Highly Cited
1963
Highly Cited
1963
As a result of the work of Turing, Post, Kleene and Church [1, 2, 3, 9, 10, l l 12, 17, 18] it is now widely accepted ~ that the… Expand
  • figure 1
Is this relevant?