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
2023
Highly Cited
2023
In the last chapter we saw how to use first order predicate logic (FOPL) as a system for representation and reasoning. We noted… 
2017
2017
Johnson (1972) and Kaplan & Kay (1994) showed that phonological processes belong to the computational class of regular relations… 
1997
1997
The aim of this paper is to point out the equivalence between three notions respectively issued from recursion theory… 
1995
1995
It is argued that Hellman's arguments purporting to demonstrate that constructive mathematics cannot cope with unbounded… 
1994
1994
We introduce and study two classifications refining the polynomial hierarchy. Both extend the difference hierarchy over NP and… 
1991
1988
1988
Intuitionistic type theories, originally developed by Martin-Lof, provide a foundation for intuitionistic mathematics, much as… 
1977
1977
We describe work in progress on an automatic theorem prover for recursive function theory that we intend to apply in the analysis… 
1967