Strengthening prompt simplicity

DOI10.2178/JSL/1309952528zbMath1247.03074OpenAlexW2137859318MaRDI QIDQ3173534

Keng Meng Ng, David E. Diamondstone

Publication date: 10 October 2011

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

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

zbMATH Keywords

lownesswtt-degreeprompt simplicitystrong promptnesssuperlow cuppability

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Cites Work

• Unnamed Item
• Strong jump-traceability. I: The computably enumerable case
• Lowness properties and randomness
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Promptness does not imply superlow cuppability

This page was built for publication: Strengthening prompt simplicity