Low (computability)
= Low (computability)
{wiki=Low_(computability)}
In the context of computability theory, the term "low" usually refers to a classification of degrees of unsolvability or computably enumerable (c.e.) sets that are relatively "simple" in terms of their Turing degrees. Specifically, a set (or degree) is said to be low if it is computationally weak in a certain sense.