Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Hi-index | 0.00 |
Let f:ω→ω be a total function and f̂={〈x,y 〉: x∈ω& y≤f(x)}. A set A⊆ω is called bounded total if A = f̂ for some total function f. In this paper we study enumeration degrees of the bounded total sets.