A generic m-reducibility

DOI10.1007/978-3-319-94418-0_36MaRDI QIDQ1670764zbMATH OpenOpenAlexFDO

Authors Alexander Rybalov

Publication date 6 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94418-0_36

Mathematics Subject Classification ID

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

Recommendations

• A generic relation on recursively enumerable sets
• Generic computability, Turing degrees, and asymptotic density
• A minimal pair in the generic degrees
• Nonexistence of minimal pairs for generic computability
• Generic undecidability of universal theories

Cited in

(6)

• A generic relation on recursively enumerable sets
• Nonexistence of minimal pairs for generic computability
• Generic Muchnik reducibility and presentations of fields
• \(m\)-reducibility with upper and lower bounds for reducing functions
• scientific article; zbMATH DE number 4012595 (Why is no real title available?)
• scientific article; zbMATH DE number 49757 (Why is no real title available?)

This page was built for publication: A generic m-reducibility

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