Matches in DBpedia 2014 for { <http://dbpedia.org/resource/High_(computability)> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- High_(computability) abstract "In computability theory, a Turing degree [X] is high if it is computable in 0′, and the Turing jump [X′] is 0′′, which is the greatest possible degree in terms of Turing reducibility for the jump of a set which is computable in 0′ (Soare 1987:71).".
- High_(computability) wikiPageID "9767177".
- High_(computability) wikiPageRevisionID "506619167".
- High_(computability) hasPhotoCollection High_(computability).
- High_(computability) subject Category:Computability_theory.
- High_(computability) comment "In computability theory, a Turing degree [X] is high if it is computable in 0′, and the Turing jump [X′] is 0′′, which is the greatest possible degree in terms of Turing reducibility for the jump of a set which is computable in 0′ (Soare 1987:71).".
- High_(computability) label "High (computability)".
- High_(computability) sameAs m.02prkr9.
- High_(computability) sameAs Q5754843.
- High_(computability) sameAs Q5754843.
- High_(computability) wasDerivedFrom High_(computability)?oldid=506619167.
- High_(computability) isPrimaryTopicOf High_(computability).