Superhighness and Strong Jump Traceability [chapter]

André Nies
2009 Lecture Notes in Computer Science  
Let A be a c.e. set. Then A is strongly jump traceable if and only if A is Turing below each superhigh Martin-Löf random set. The proof combines priority with measure theoretic arguments.
doi:10.1007/978-3-642-02927-1_60 fatcat:quzpuqeaefhbdpndwbar4puq2a