Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

25 relations
Algorithmically random sequenceArithmetical hierarchyChaitin's constantComputable function

Broader (2)

Computability theoryTheory of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The urban road bus signals mode of priority
The present invention provides a kind of urban road bus signals mode of priority, and using phase lock mechanisms, the right-turn… 
2016
2016
Upload Planning for Mobile Data Collection in Smart Community Internet-of-Things Deployments
In this paper, we develop effective solutions for enabling mobile sensing/data collection in community IoT deployments where… 
2010
2010
Modeling Self-Organizing, Faulty Peer-to-Peer Systems as Complex Networks
The theory of complex networks provides effective mathematical tools for analyzing properties of communication systems. This… 
2007
2007
Scalable and deterministic key agreement for large scale networks
Key agreement is a central problem to build up secure infrastructures for networks. Public key technology may not be suitable in… 
2007
2007
The Atomic Model Theorem
We investigate the complexity of several classical model theoretic theorems about prime and atomic models and omitting types… 
2004
2004
DOUBLE JUMP INVERSIONS AND STRONG MINIMAL COVERS IN THE TURING DEGREES
Decidability problems for (fragments of) the theory of the structure D of Turing degrees, form a wide and interesting class, much… 
1976
1976
Co-hypersimple structures
Priority arguments have been used to produce r.e. sets whose complements have various properties (e.g., maximal sets… 
1967
1967
ON A THEOREM OF LACHLAN AND MARTIN
In [3] we raised the following question: does there exist a recursively enumerable degree d such that 0(n)< <(n) < O(n+1) for all… 
Review
1960
Review
1960
Review: Richard M. Friedberg, A Criterion for Completeness of Degrees of Unsolvability
1959
1959
Computing degrees of unsolvability