Skip to search formSkip to main contentSkip to account menu

Turing reduction

Known as: Turing reducible, Turing reducibility, Turing complete (reduction) 
In computability theory, a Turing reduction from a problem A to a problem B, is a reduction which solves A, assuming the solution to B is already… 
Wikipedia (opens in a new tab)

Related topics

Related topics

36 relations
AlgorithmAlgorithmically random sequenceArithmetical setBerman–Hartmanis conjecture

Broader (1)

Computability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
On the computability of graphons
We investigate the relative computability of exchangeable binary relational data when presented in terms of the distribution of… 
2012
2012
On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks
The goal of this work is to show that if a minimal-time solution exists for a fundamental computation primitive, synchronizing… 
2011
2011
Relativizations of randomness and genericity notions
A set A is a base for Schnorr randomness if it is Turing reducible to a set R that is Schnorr random relative to A, and the… 
2004
2004
On the reducibility of sets inside NP to sets with low information content
2004
2004
Separating complexity classes using structural properties
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S… 
1995
1995
Computable Concurrent Processes
1991
1991
Bounds on the Costs of Register Implementations
A fundamental aspect of any concurrent system is how processes communicate with each other. Ultimately, all communication… 
1988
1988
On the theory of the PTIME degrees of the recursive sets
An interpretation is given of first-order arithmetic in the theory of the PTIME degrees of the recursive sets, ordered under… 
1987
1987
Group actions on the complex projective plane
0. Introduction. In this paper we consider homologically trivial, locally smooth actions of finite and compact Lie groups on… 
1969
1969
Uniformly reflexive structures: On the nature of gödelizations and relative computability
In this paper we present an axiomatic theory within which much of the theory of computability can be developed in an abstract… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)