Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

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… 
Highly Cited
1996
Highly Cited
1996
  • R. Soare
  • Bulletin of Symbolic Logic
  • 1996
  • Corpus ID: 5894394
Abstract We consider the informal concept of “computability” or “effective calculability” and two of the formalisms commonly used… 
Highly Cited
1990
Highly Cited
1990
  • Ming LiP. Vitányi
  • Handbook of Theoretical Computer Science, Volume…
  • 1990
  • Corpus ID: 34425621
Highly Cited
1985
Highly Cited
1985
  • M. Fitting
  • The Journal of Logic Programming
  • 1985
  • Corpus ID: 42564630
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… 
Highly Cited
1983
Highly Cited
1983
  • G. Longo
  • Annals of Pure and Applied Logic
  • 1983
  • Corpus ID: 2899047
Highly Cited
1980
Highly Cited
1980
Preface Prologue, prerequisites and notation 1. Computable functions 2. Generating computable functions 3. Other approaches to… 
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… 
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… 
Highly Cited
1959