Literature cited
W. F. Stout, “A Martingale analogue of Kolmogorov's law of the iterated logarithm,” Z. Wahrsch. Verw. Gebiete,15, 279–290 (1970).
V. V. B'yugin, “Algorithmic entropy (complexity) of finite objects and its application to the definition of randomness and quantity of information,” Semiotics and Information Science,16, 14–43 (1981).
H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
V. A. Uspenskii and A. L. Semenov, The Theory of Algorithms: Basic Developments and Applications [in Russian], Moscow, Nauka (1987).
A. N. Shiryaev, Probability [in Russian], Nauka, Moscow (1980).
W. Feller, Introduction to Probability Theory and Its Applications, Vol. 1, Wiley, New York (1968).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 44, No. 1, pp. 27–37, July, 1988.
Rights and permissions
About this article
Cite this article
Vovk, V.G. Kolmogorov-Stout law of the iterated logarithm. Mathematical Notes of the Academy of Sciences of the USSR 44, 502–507 (1988). https://doi.org/10.1007/BF01158114
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01158114