Promptness does not imply superlow cuppability

DOI10.2178/JSL/1254748690MaRDI QIDQ3655255zbMATH OpenOpenAlexFDO

Authors David Diamondstone

Publication date 7 January 2010

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/jsl/1254748690

zbMATH Keywords

promptly simple setsuperlow cuppability

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Prompt delay
• Some Delays do not matter
• From Liveness to Promptness
• From liveness to promptness
• scientific article; zbMATH DE number 5257278
• Speed scaling for maximum lateness
• Speed scaling for maximum lateness
• Slow consistency

Cites work

• A Refinement of Lown and Highn for the R.E. Degrees
• Algorithmic randomness and complexity.
• Calibrating Randomness
• Class groups of integral group rings
• scientific article; zbMATH DE number 1688364 (Why is no real title available?)
• scientific article; zbMATH DE number 225477 (Why is no real title available?)
• Lowness properties and randomness
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES

Cited in

(7)

• A random set which only computes strongly jump-traceable c.e. sets
• Benign cost functions and lowness properties
• Strengthening prompt simplicity
• Some Delays do not matter
• Prompt simplicity, array computability and cupping
• Strong jump-traceability
• Cupping and jump classes in the computably enumerable degrees

This page was built for publication: Promptness does not imply superlow cuppability

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