An answer to the gamma question

DOI10.1145/3209108.3209117MaRDI QIDQ5145349zbMATH OpenOpenAlexFDO

Authors Benoit Monin

Publication date 20 January 2021

Published in Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3209108.3209117

zbMATH Keywords

coarse computabilitycomputabilityTuring degrees

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

Recommendations

• A unifying approach to the Gamma question
• The gamma question for many-one degrees
• Muchnik degrees and cardinal characteristics
• Asymptotic density and the coarse computability bound
• A minimal pair in the generic degrees

Cited in

(5)

• Asymptotic density and computability
• A unifying approach to the Gamma question
• Muchnik degrees and cardinal characteristics
• The gamma question for many-one degrees
• Compression of enumerations and gain

This page was built for publication: An answer to the gamma question

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