Strengthening prompt simplicity

DOI10.2178/JSL/1309952528MaRDI QIDQ3173534zbMATH OpenOpenAlexFDO

Authors Keng Meng Ng, David Diamondstone

Publication date 10 October 2011

Published in 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)

Recommendations

• Simplicity simplified
• Simplicity
• Strong semi-simplicity
• Simplicity Is the Point
• Prime simplicity
• From Stability to Simplicity
• A simplification of the theory of simplicity

Cites work

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

Cited in

(3)

• Prompt simplicity, array computability and cupping
• Benign cost functions and lowness properties
• Simplicity

This page was built for publication: Strengthening prompt simplicity

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