Splitting into degrees with low computational strength
From MaRDI portal
Publication:2636531
DOI10.1016/j.apal.2018.04.004zbMath1469.03117OpenAlexW2800331427MaRDI QIDQ2636531
Keng Meng Ng, Rodney G. Downey
Publication date: 5 June 2018
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2018.04.004
Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25)
Related Items
A classification of low c.e. sets and the Ershov hierarchy, A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES, Lowness for Demuth Randomness, Hierarchy of Computably Enumerable Degrees II
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the degrees of diagonal sets and the failure of the analogue of a theorem of Martin
- Minimal pairs in initial segments of the recursively enumerable degrees
- Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability
- Lowness properties and randomness
- Algorithmic Randomness and Complexity
- Minimal pairs and high recursively enumerable degrees
- Highness and bounding minimal pairs
- A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES
- On very high degrees