Maximality and collapse in the hierarchy of α-c.a. degrees
From MaRDI portal
Publication:5859843
DOI10.3233/COM-200297zbMath1495.03059OpenAlexW3134710013MaRDI QIDQ5859843
Katherine Arthur, Noam Greenberg, Rodney G. Downey
Publication date: 18 November 2021
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/com-200297
Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55)
Cites Work
- Dynamic notions of genericity and array noncomputability
- On degrees of unsolvability
- TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
- Maximal contiguous degrees
- A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES
- A Hierarchy of Turing Degrees
- Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item