Lowness for the Class of Schnorr Random Reals

Authors:
Bjorn Kjos-Hanssen;André Nies;Frank Stephan
Affiliations:
-;-;-
Venue:
SIAM Journal on Computing
Year:
2005

Citing 0
Cited 6

Schnorr Trivial Reals: A construction

Electronic Notes in Theoretical Computer Science (ENTCS)
Lowness for Demuth Randomness

CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Kolmogorov complexity and the recursion theorem

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Lowness for weakly 1-generic and kurtz-random

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
A K-trivial set which is not jump traceable at certain orders

Information Processing Letters
Reconciling data compression and kolmogorov complexity

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We answer a question of Ambos-Spies and Kucera in the affirmative. They asked whether, when a real is low for Schnorr randomness, it is already low for Schnorr tests.