BOUNDS IN THE TURING REDUCIBILITY OF FUNCTIONS
Karol Habart, Karol Habart · Mathematical logic quarterly · 1992
Abstract A hierarchy of functions with respect to their role as bounds in the Turing reducibility of functions is introduced and studied. This hierarchy leads to a certain notion of incompressibility of sets which is also investigated.