Low (computability)

In computability theory, a Turing degree [X] is called low if the Turing jump [X′] is 0′, which is the least possible degree in terms of Turing reducibility for the jump of a set.

See Also

High (computability) Low Basis Theorem

References

Soare, R. Recursively enumerable sets and degrees. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987. ISBN 3-540-15299-7