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.
Highly Cited
2014
Highly Cited
2014
Highly Cited
2012
Highly Cited
2012
We introduce return-oriented programming, a technique by which an attacker can induce arbitrary behavior in a program whose… 
Highly Cited
2010
Highly Cited
2010
Preface.- Acknowledgments.- Introduction.- I. Background.- Preliminaries.- Computability Theory.- Kolmogorov Complexity of Finite… 
Highly Cited
1999
Highly Cited
1999
The primary notion of effective computability is that provided by Turing machines (or equivalently any of the other common models… 
Highly Cited
1996
Highly Cited
1996
  • R. Soare
  • Bulletin of Symbolic Logic
  • 1996
  • Corpus ID: 5894394
Abstract We consider the informal concept of “computability” or “effective calculability” and two of the formalisms commonly used… 
Highly Cited
1991
Highly Cited
1991
In this paper, two interesting complexity classes, PP and $ \oplus {\text{P}}$, are compared with PH, the polynomial-time… 
Highly Cited
1984
Highly Cited
1983
Highly Cited
1983
  • C. Yap
  • Theoretical Computer Science
  • 1983
  • Corpus ID: 31802674
Highly Cited
1983
Highly Cited
1983
  • K. Ko
  • Journal of computer and system sciences (Print)
  • 1983
  • Corpus ID: 11611279
Highly Cited
1963
Highly Cited
1963
There are two different ways of describing uynamicu systems: (i) bymeans of state variables and (ii) by input/output relations…