A K-trivial set which is not jump traceable at certain orders

Authors:
Daniel Turetsky
Affiliations:
Department of Mathematics, Victoria University of Wellington, Wellington, New Zealand
Venue:
Information Processing Letters
Year:
2012

Citing 4
Cited 0

Lowness for the Class of Schnorr Random Reals

SIAM Journal on Computing
Visualization 2001 Conference (Acm

Visualization 2001 Conference (Acm
Computability and Randomness

Computability and Randomness
Time-Bounded Kolmogorov Complexity and Solovay Functions

MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009

Quantified Score

Hi-index	0.89

Visualization

Abstract

We construct a K-trivial c.e. set which is not jump traceable at any order in o(logx).