Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,587,952 papers from all fields of science
Search
Sign In
Create Free Account
Turing degree
Known as:
Turing equivalence (recursion theory)
, Recursively enumerable Turing degree
, T-degree
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
25 relations
Algorithmically random sequence
Arithmetical hierarchy
Chaitin's constant
Computable function
Expand
Broader (2)
Computability theory
Theory of computation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Exemplar-Based Image Inpainting Using Color Distribution Analysis
Qing Zhang
,
Jianjun Lin
Journal of information science and engineering
2012
Corpus ID: 18556177
This paper proposes a novel exemplar-based inpianting algorithm based upon the color distribution analysis. A novel priority…
Expand
2007
2007
GLOBAL PROPERTIES OF THE TURING DEGREES AND THE TURING JUMP
T. Slaman
2007
Corpus ID: 15526259
We present a summary of the lectures delivered to the Institute for Mathematical Sciences, Singapore, during the 2005 Summer…
Expand
2002
2002
Priority method for a kind of multi-attribute decision-making problems
Xu Ze
2002
Corpus ID: 124103731
This paper studies a kind of uncertain multi attribute decision making problems,in which the information about the attribute…
Expand
2001
2001
Processing location-dependent queries in a multi-cell wireless enviroment
Baihua Zheng
,
Lee
ACM International Workshop on Data Engineering…
2001
Corpus ID: 7012993
We develop several methods for scheduling location-dependent queries clients cross cell bounderies in a multi-cell wireless…
Expand
2001
2001
The Least Variance Priority Method (LVM) for Fuzzy Complementary Judgement Matrix
Ze-shui Xu
2001
Corpus ID: 124198831
This paper gives a definition of rank transitive fuzzy complementary judgement matrix, and presents a priority method-the least…
Expand
1994
1994
A strategic decision model for the selection of advanced technology
C. Kuei
,
Chinho Lin
,
J. Aheto
,
C. Madu
1994
Corpus ID: 62190563
Abstract This paper introduces models for the selection of advanced technologies. It is based on the concept that technologies…
Expand
1989
1989
Complementation in the Turing degrees
T. Slaman
,
J. Steel
Journal of Symbolic Logic (JSL)
1989
Corpus ID: 37558368
Abstract Posner [6] has shown, by a nonuniform proof, that every degree has a complement below 0′. We show that a 1-generic…
Expand
1987
1987
T-degrees, jump classes, and strong reducibilities
R. Downey
,
C. Jockusch
1987
Corpus ID: 52227666
It is shown that there exist r.e. degrees other than 0 and 0' which have a greatest r.e. 1-degree. This solves an old question of…
Expand
Highly Cited
1986
Highly Cited
1986
Definability in the Turing degrees
T. Slaman
,
W. Woodin
1986
Corpus ID: 14541212
On etend a toutes les relations denombrables le theoreme de Spector selon lequel tout ideal denombrable dans les degres de Turing…
Expand
1985
1985
Complexity Results on the Conjugacy Problem for Monoids
P. Narendran
,
F. Otto
Theoretical Computer Science
1985
Corpus ID: 28104119
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE