Shen’, A. Algorithmic complexity and randomness: Recent developments. (English. Russian original) Zbl 0815.60003 Theory Probab. Appl. 37, No. 1, 92-97 (1992); translation from Teor. Veroyatn. Primen. 37, No. 1, 124-131 (1992). The paper of A. N. Kolmogorov and V. A. Uspenskij [Theory Probab. Appl. 32, No. 3, 389-412 (1987); translation from Teor. Varoyatn. Primen. 32, No. 3, 425-455 (1987; Zbl 0627.60006)] gives an overview on the topics algorithmic complexity and randomness up to 1986. The present author’s aim is to discuss some recent developments in these fields. Cited in 3 Documents MSC: 60A99 Foundations of probability theory Keywords:complexity; entropy; algorithmic definition of randomness; generation of random numbers Citations:Zbl 0648.60005; Zbl 0627.60006 PDF BibTeX XML Cite \textit{A. Shen'}, Theory Probab. Appl. 37, No. 1, 92--97 (1992; Zbl 0815.60003); translation from Teor. Veroyatn. Primen. 37, No. 1, 124--131 (1992) Full Text: DOI OpenURL