scientific article
From MaRDI portal
Publication:3530405
zbMath1157.03020MaRDI QIDQ3530405
Publication date: 20 October 2008
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
Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Almost everywhere domination and superhighness ⋮ Mass problems and almost everywhere domination ⋮ Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions ⋮ Mass problems associated with effectively closed sets
