Some fundamental issues concerning degrees of unsolvability

MaRDI QIDQ3530405zbMATH OpenFDO

Authors Stephen G. Simpson

Publication date 20 October 2008

zbMATH Keywords

dominationlattice embeddingmass problemsMedvedev degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Mass Problems and Randomness
• Degrees of unsolvability: a tutorial
• scientific article; zbMATH DE number 3914306
• Mass problems and almost everywhere domination
• Mass problems associated with effectively closed sets

Cited in

(12)

• Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
• MASS PROBLEMS AND HYPERARITHMETICITY
• Mathematical Foundations of Computer Science 2003
• Mass problems associated with effectively closed sets
• Almost everywhere domination and superhighness
• Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
• Degrees of unsolvability: a tutorial
• scientific article; zbMATH DE number 3914306 (Why is no real title available?)
• Mass Problems and Randomness
• scientific article; zbMATH DE number 512805 (Why is no real title available?)
• scientific article; zbMATH DE number 3926899 (Why is no real title available?)
• Mass problems and almost everywhere domination

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)