The Law of the Iterated Logarithm for p-Random Sequences

Authors:
Yongge Wang
Affiliations:
-
Venue:
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Year:
1996

Citing 0
Cited 1

Strong reductions and isomorphism of complete sets

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The stochastic properties of p-random sequences are studied in this paper. It is shown that the law of the iterated logarithm holds for p-random sequences. This law gives a quantitative characterization of the density of p-random sets. When combined with the invariance property of p-random sequences, this law is also useful in proving that some complexity classes have p-measure 0.