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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The goal of this work is to show that if a minimal-time solution exists for a fundamental computation primitive, synchronizing… 
2011
2011
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
2004
2004
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… 
1999
1999
  • R. Shore
  • 1999
  • Corpus ID: 13346832
1991
1991
A fundamental aspect of any concurrent system is how processes communicate with each other. Ultimately, all communication… 
1987
1987
0. Introduction. In this paper we consider homologically trivial, locally smooth actions of finite and compact Lie groups on… 
1985
1985
We show that the problem of finding an infinite set of indis- cernibles in an arbitrary decidable model of a first order theory… 
1969
1969
In this paper we present an axiomatic theory within which much of the theory of computability can be developed in an abstract…