Translate:
English
Chinese (S)
Chinese (T)
Croatian
Dutch
French
German
Hebrew
Italian
Japanese
Korean
Portuguese
Russian
Serbian
Spanish
Swedish
Turkish
Additional
High (computability)
English Wikipedia - The Free Encyclopedia
Download this dictionary
High (computability)
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).
See more at Wikipedia.org...
© This article uses material from
Wikipedia
®
and is licensed under the
GNU Free Documentation License
and under the
Creative Commons Attribution-ShareAlike License