A recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x), f is a k(n)-enumerator if for every input x of length n, h(x) is among ...
A set 𝐴 ⊆ 𝜔 is cototal under enumeration reducibility if A≤eA¯, that is, if the complement of 𝐴 is total. We show that the 𝑒-degrees of cototal sets characterize the 𝑒-degrees of maximal ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback