Some properties of sw-reducibility

MaRDI QIDQ5469464zbMATH OpenFDO

Authors

Publication date 19 May 2006

zbMATH Keywords

c.e. realsstrongly c.e. realssw-degrees

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• There is an Sw-Cuppable Strongly c.e. Real
• A c.e. real that cannot be sw-computed by any \(\Omega\) number
• There is no SW-complete c.e. real
• New Computational Paradigms
• Computing and Combinatorics

Cited in

(5)

• Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
• Where join preservation fails in the bounded Turing degrees of c.e. sets
• On the strongly bounded Turing degrees of the computably enumerable sets
• There is no SW-complete c.e. real
• New Computational Paradigms

This page was built for publication: Some properties of sw-reducibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5469464)