scientific article
From MaRDI portal
Publication:3724315
zbMath0594.03024MaRDI QIDQ3724315
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (6)
Diagonalizations over polynomial time computable sets ⋮ Non-p-generic and strongly nonbranching degree ⋮ Non-p-generic and strongly nonbranching degree ⋮ T-Degrees, Jump Classes, and Strong Reducibilities ⋮ Generic objects in recursion theory. II: Operations on recursive approximation spaces ⋮ Dynamic notions of genericity and array noncomputability
This page was built for publication:
