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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… (More)
  • figure 1
  • figure 4
  • figure 6
  • figure 8
  • figure 10
Is this relevant?
2012
2012
Return-oriented programming (ROP) has gained a lot of popularity lately, as an attack against currently implemented defenses in… (More)
  • table 1
  • figure 1
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
2008
2008
Introduction Investigation of the infinite behavior of computing devices is of great interest for computer science because many… (More)
Is this relevant?
2007
2007
The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the… (More)
Is this relevant?
2000
2000
We show that any two Medvedev complete Π1 subsets of 2 ω are recursively homeomorphic. We obtain a Π1 set b Q ′ of countable… (More)
Is this relevant?
1998
1998
The computable sets form the minimum ω-model of RCA0 and any ω-model of RCA0 is closed under Turing reducibility. RCA0 is strong… (More)
Is this relevant?
1995
1995
This paper investigates the structure of ESPACE under nonuniformTuring reductions that are computed by polynomial size circuits P… (More)
Is this relevant?
1989
1989
Since the pioneering work of Cook and Karp, an extensive effort has been made in identifying hundreds of apparently intractable… (More)
  • figure 1.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 3.4
Is this relevant?
Highly Cited
1982
Highly Cited
1982
In a distributed computing system made up of different types of processors each processor in the system may have different… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
1977
1977
An open question of [LLS] is whether polynomial time many-one reducibility ≤<subscrpt>m</subscrpt><supscrpt><italic>P</italic… (More)
Is this relevant?