Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Fuzzy analytic hierarchy process (AHP) proves to be a very useful methodology for multiple criteria decision-making in fuzzy… Expand
  • figure 1
  • table 2
  • table 1
  • table 3
  • table 4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
The last forty years have witnessed a remarkable boom in higher education around the world. Importantly, the boom in higher… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is ?-random if it is Martin… Expand
Is this relevant?
2005
2005
  • J. Mileti
  • Bull. Symb. Log.
  • 2005
  • Corpus ID: 8821300
The connections between mathematical logic and combinatorics have a rich history. This paper focuses on one aspect of this… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
  • R. Xu
  • Fuzzy Sets Syst.
  • 2000
  • Corpus ID: 28392103
The least-squares priority method is an effective priority method in the analytic hierarchy process. But it is not appropriate… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
TABLE OF CONTENTS Introduction Chapter I. The relation of the structure of an r.e. set to its degree. 1. Post's program and… Expand
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
1979
Highly Cited
1979
An introduction to degrees of unsolvability.- The undecidability of the theory of degrees.- Various finite distributive lattices… Expand
Is this relevant?
Highly Cited
1971
Highly Cited
1971
  • J. Shoenfield
  • North-Holland mathematics studies
  • 1971
  • Corpus ID: 115539572
In [4], Kleene and Post showed that there are degrees between 0 (the degree of recursive sets) and 0' (the highest degree of… Expand
Is this relevant?
Highly Cited
1966
Highly Cited
1966
The degrees of unsolvability have been extensively studied by Sacks in (4). This paper studies problems concerned with lower… Expand
Is this relevant?
Highly Cited
1959
Highly Cited
1959
This is the third of a series of papers in these Transactions on hierarchies obtained by quantifying variables of recursive… Expand
Is this relevant?