Turing degree

Known as: Turing equivalence (recursion theory), Recursively enumerable Turing degree, T-degree 
In computer science and mathematical logic the Turing degree (named after Alan Turing) or degree of unsolvability of a set of natural numbers… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Subshifts are shift invariant closed subsets of Σ d , minimal subshifts are subshifts in which all points contain the same… (More)
Is this relevant?
2017
2017
The degree spectrum of a countable structure is the set of all Turing degrees of presentations of that structure. We show that… (More)
Is this relevant?
2012
2012
The Turing degree of a real measures the computational difficulty of producing its binary expansion. Since Turing degrees are… (More)
Is this relevant?
2010
2010
We investigate computability theoretic and topological properties of spaces of orders on computable orderable groups. A left… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
TABLE OF CONTENTS Introduction Chapter I. The relation of the structure of an r.e. set to its degree. 1. Post's program and… (More)
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is n-random if it is Martin… (More)
Is this relevant?
1998
1998
  • Steffen Lempp asked
  • 1998
It is proven that there is a family of sets of natural numbers which has enumerations in every Turing degree except for the… (More)
Is this relevant?
1998
1998
A model is computable if its domain is a computable set and its relations and functions are uniformly computable. Let A be a… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
An explicit recursion-theoretic definition of a random sequence or random set of natural numbers was given by Martin-Löf in 1966… (More)
Is this relevant?
1986
1986
Suppose that R is a countable relation on the Turing degrees. Then R can be defined in D, the Turing degrees with ≤T , by a first… (More)
Is this relevant?