Some fundamental issues concerning degrees of unsolvability
From MaRDI portal
Publication:3530405
zbMATH Open1157.03020MaRDI QIDQ3530405FDOQ3530405
Publication date: 20 October 2008
Recommendations
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Cited In (11)
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Mass problems associated with effectively closed sets
- MASS PROBLEMS AND HYPERARITHMETICITY
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
- Mathematical Foundations of Computer Science 2003
- Mass Problems and Randomness
- Mass problems and almost everywhere domination
- Title not available (Why is that?)
- Almost everywhere domination and superhighness
This page was built for publication: Some fundamental issues concerning degrees of unsolvability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3530405)