A generic m-reducibility

DOI10.1007/978-3-319-94418-0_36OpenAlexW2811089831MaRDI QIDQ1670764FDOQ1670764

Authors: Alexander Rybalov 

Publication date: 6 September 2018

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

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

Mathematics Subject Classification ID

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

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
• Title not available (Why is that?)
• Title not available (Why is that?)

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)