Superhighness and Strong Jump Traceability
From MaRDI portal
Publication:3638076
DOI10.1007/978-3-642-02927-1_60zbMath1248.03064OpenAlexW1541694852MaRDI QIDQ3638076
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_60
Recursively (computably) enumerable sets and degrees (03D25) Algorithmic randomness and dimension (03D32)
Related Items (2)
Upper bounds on ideals in the computably enumerable Turing degrees ⋮ Characterizing the strongly jump-traceable sets via randomness
This page was built for publication: Superhighness and Strong Jump Traceability