Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,251,884 papers from all fields of science
Search
Sign In
Create Free Account
Turing reduction
Known as:
Turing reducible
, Turing reducibility
, Turing complete (reduction)
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
36 relations
Algorithm
Algorithmically random sequence
Arithmetical set
Berman–Hartmanis conjecture
Expand
Broader (1)
Computability theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks
Darin Goldstein
,
Kojiro Kobayashi
SIAM journal on computing (Print)
2012
Corpus ID: 27965746
The goal of this work is to show that if a minimal-time solution exists for a fundamental computation primitive, synchronizing…
Expand
2011
2011
Relativizations of randomness and genericity notions
Johanna N. Y. Franklin
,
F. Stephan
,
Liang Yu
2011
Corpus ID: 16981410
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…
Expand
2004
2004
On the reducibility of sets inside NP to sets with low information content
Mitsunori Ogihara
,
Till Tantau
Journal of computer and system sciences (Print)
2004
Corpus ID: 11030898
2004
2004
Separating complexity classes using structural properties
H. Buhrman
,
L. Torenvliet
Proceedings. 19th IEEE Annual Conference on…
2004
Corpus ID: 10451061
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…
Expand
1999
1999
The Recursively Enumerable Degrees
R. Shore
Handbook of Computability Theory
1999
Corpus ID: 13346832
1995
1995
Computable Concurrent Processes
Y. Moschovakis
Theoretical Computer Science
1995
Corpus ID: 37879695
1991
1991
Bounds on the Costs of Register Implementations
S. Chaudhuri
,
J. Welch
International Workshop on Distributed Algorithms
1991
Corpus ID: 39647104
A fundamental aspect of any concurrent system is how processes communicate with each other. Ultimately, all communication…
Expand
1987
1987
Group actions on the complex projective plane
Dariusz M. Wilczyński
1987
Corpus ID: 30014754
0. Introduction. In this paper we consider homologically trivial, locally smooth actions of finite and compact Lie groups on…
Expand
1985
1985
DEGREES OF INDISCERNIBLES IN DECIDABLE MODELS
H. Kierstead
,
J. Remmel
1985
Corpus ID: 51823900
We show that the problem of finding an infinite set of indis- cernibles in an arbitrary decidable model of a first order theory…
Expand
1969
1969
Uniformly reflexive structures: On the nature of gödelizations and relative computability
E. Wagner
1969
Corpus ID: 399761
In this paper we present an axiomatic theory within which much of the theory of computability can be developed in an abstract…
Expand
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)
ACCEPT & CONTINUE