Prompt simplicity, array computability and cupping

zbMATH Open1156.03041MaRDI QIDQ3530392FDOQ3530392

Authors: Noam Greenberg, Joseph S. Miller, Rebecca Weber, Rodney G. Downey 

Publication date: 20 October 2008

Recommendations

• Promptness does not imply superlow cuppability
• Cuppability of simple and hypersimple sets
• Cupping and jump classes in the computably enumerable degrees
• Strengthening prompt simplicity
• A hierarchy for cuppable degrees

zbMATH Keywords

array computable degreepromptly simple degree

Mathematics Subject Classification ID

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

Cited In (2)

• Cupping computably enumerable degrees simultaneously
• CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES

This page was built for publication: Prompt simplicity, array computability and cupping

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