Since every set is computable from its jump, any low set is computable in 0′, but the jump of sets computable in 0′ can bound any degree recursively enumerable in 0′ (Schoenfield Jump Inversion).
Since every set relies on its jump for computation, any low set is computable in 0′; however, the jumps of sets computable in 0′ can control any recursively enumerable degree (Schoenfield Jump Inversion).