Bibliography

(eng): Classes of strings (infinite sequences resp.) are introduced. Lower bounds of Kolmogorov complexity are prescribed to strings (initial segments of infinite sequences resp.) of specified lengths. Dependence of probabilities of the classes on lower bounds of Kolmogorov complexity is studied. Conditions are found under which the probabilities of the classes of the strings are close to one, probabilities of the classes of sequences equal one. A variant of theorem on infinite oscillations is derived.