DocumentCode
2116130
Title
The law of the iterated logarithm for random sequences
Author
Wang, Yongge
Author_Institution
Math. Inst., Heidelberg Univ., Germany
fYear
1996
fDate
24-27 May 1996
Firstpage
180
Lastpage
189
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
Keywords
computational complexity; sequences; complexity classes; invariance property; iterated logarithm; quantitative characterization; random sequences; Chaos; Computational complexity; Entropy; Frequency; Logic; Mathematics; Particle measurements; Random sequences; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Complexity, 1996. Proceedings., Eleventh Annual IEEE Conference on
Conference_Location
Philadelphia, PA
Print_ISBN
0-8186-7386-9
Type
conf
DOI
10.1109/CCC.1996.507680
Filename
507680
Link To Document