Skip to search formSkip to main contentSkip to account menu

Reduction (recursion theory)

Known as: Reducibility relation, Reduction 
In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
There are two main theories of ontological commitment: the quantifier view, and the truthmaker view. Since there are some truths… 
2014
2014
  • D. Spreen
  • 2014
  • Corpus ID: 1377891
As has been shown by the author, standard numberings of the computable real numbers and similar effectively given topological… 
2011
2011
Blass showed that on each infinite cardinal, there is an algebra structure of games on it. Blass defined a reducibility relation… 
2009
2009
We continue the study of the local theory of the structure of the ω-enumeration degrees, started by Soskov and Ganchev [7]. We… 
2008
2008
This lecture gives a general introduction of P, NP and NP-complete problems. We will study the definition and some classic… 
2005
2005
Abstract.A strong reducibility relation between partial numberings is introduced which is such that the reduction function… 
2004
2004
Decidability problems for (fragments of) the theory of the structure D of Turing degrees, form a wide and interesting class, much… 
Highly Cited
1986
Highly Cited
1986
We show that, for any set A which cannot be computed in polynomial time, the class of sets p-many-one incomparable with A has… 
1984
1984
In this paper, we investigate the quotient semilattice R/M of the r.e. degrees modulo the cappable degrees. We first prove the R… 
1984
1984
In this paper we consider a 2-dimensional array acceptor, called Turing array machine /TAM/, which is a generalization of k-tape…