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.
2005
2005
A method and an apparatus for cache lock control are designed for use with a cache memory. The cache memory has divided entries… 
2002
2002
The McCreight-Meyer algorithm is a pi;ority-queue construction irom abstract recursion theory which was designed for the prcof of… 
1995
1995
Rabin conditions are a general class of properties of infinite seAbstract-1 quences that encompass most known automata-theoretic… 
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… 
Review
1983
Review
1983
Abstract In recent years higher recursion theory has experienced a deep interaction with other areas of logic, particularly set… 
1979
1979
A non-a-recursive subset G of an admissible ordinal a is of minimal a-degree if every set of strictly lower a-degree than that of…