Skip to main content
Conference Proceedings

Superhighness and strong jump traceability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5555 LNCS(PART 1) 726-737
DOI: 10.1007/978-3-642-02927-1_60
2Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

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. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Nies, A. (2009). Superhighness and strong jump traceability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5555 LNCS, pp. 726–737). https://doi.org/10.1007/978-3-642-02927-1_60

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free