Structures of Some Strong Reducibilities

DOI10.1007/978-3-642-03073-4_3zbMath1268.03052OpenAlexW2138429996MaRDI QIDQ3576034

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)

Related Items (2)

Maximal pairs of computably enumerable sets in the computably Lipschitz degrees ⋮ On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets

Cites Work

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

This page was built for publication: Structures of Some Strong Reducibilities