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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2009

In this paper, we have compared r.e. sets based on their enumeration orders with Turing machines. Accordingly, we have defined…

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…

1995

1995

Let A be any nonrecursive set. For each k 0, we show that there are functions (k + 1)-truth-table reducible to A that are not k…

1991

A fundamental aspect of any concurrent system is how processes communicate with each other. Ultimately, all communication…

1988

An interpretation is given of first-order arithmetic in the theory of the PTIME degrees of the recursive sets, ordered under…

1987

0. Introduction. In this paper we consider homologically trivial, locally smooth actions of finite and compact Lie groups on…

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

In this paper we present an axiomatic theory within which much of the theory of computability can be developed in an abstract…