The journal
Open the journal →The conversation starts in the journal — be the first to post.
About high
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′.
Everything about high →