Publication:3724315
From MaRDI portal
zbMath0594.03024MaRDI QIDQ3724315
Publication date: 1985
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Non-p-generic and strongly nonbranching degree, Non-p-generic and strongly nonbranching degree, Diagonalizations over polynomial time computable sets, Dynamic notions of genericity and array noncomputability, Generic objects in recursion theory. II: Operations on recursive approximation spaces, T-Degrees, Jump Classes, and Strong Reducibilities