Structures of some strong reducibilities

DOI10.1007/978-3-642-03073-4_3MaRDI QIDQ3576034zbMATH OpenOpenAlexFDO

Authors David R. Belanger

Publication date 28 July 2010

Published in Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03073-4_3

Mathematics Subject Classification ID

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

Recommendations

• Publication:4934278
• scientific article; zbMATH DE number 1531931
• T-Degrees, Jump Classes, and Strong Reducibilities
• Strong Positive Reducibilities
• Embeddings in the Strong Reducibilities Between 1 and npm

Cites work

• Algorithmic randomness and complexity.
• Computability Theory and Differential Geometry
• New Computational Paradigms
• On degrees of recursive unsolvability
• On degrees of unsolvability
• Randomness and reducibility
• Randomness and the linear degrees of computability
• The ibT degrees of computably enumerable sets are not dense
• There is no SW-complete c.e. real
• Von Mises' definition of random sequences reconsidered

Cited in

(7)

• One strengthening of \(Q\)-reducibility
• Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
• On some reducibility and existential interpretability of structures
• On the strongly bounded Turing degrees of the computably enumerable sets
• Reducts of some structures over the reals
• scientific article; zbMATH DE number 1531931 (Why is no real title available?)
• scientific article; zbMATH DE number 1390013 (Why is no real title available?)

This page was built for publication: Structures of some strong reducibilities

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