Superhighness and Strong Jump Traceability

  • Authors:

  • André Nies

  • Affiliations:

  • University of Auckland,

  • Venue:
  • ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.