Search results

Kolmogorov A. N.,Uspensky V. A. [1987] Algorithms and randomness SIAM J. Theory of Probability and Its Applications, 32, 389-412 ? book Вернуться к поиску

Uspensky V.A. [1992] Complexity and entropy: An introduction to the theory of Kolmogorov complexity Kolmogorov Complexity and Computational Complexity, 85-102, Springer-Verlag ? article Вернуться к поиску

Uspensky V.A. [1996] Kolmogorov complexity: recent research in Moscow Lect. Notes in Comp. Sci., 1113, 156-166, Springer-Verlag ? article Вернуться к поиску

Uspensky V.A. [1992] Kolmogorov and mathematical logic J. Symbolic Logic, 57, № 2, 385-422 93.04.25 article Вернуться к поиску

Kummer M. [1995] Kolmogorov complexity and instance complexity of recursively enumerable sets SIAM J. Comput., 25, № 6, 1123-1143 97.ВН9.103 article Вернуться к поиску

Uspensky V. A., Shen A. Kh. [1996] Relations between varieties of Kolmogorov complexities Math. Syst. Theory, 29, № 3, 271-292 97.Г4.123 article Вернуться к поиску

... Kalimullin I. Sh. Kalmár L Kanda A. Kaphengst H. Karp C. Kastanas J.G. Kastermans B. Kechris A.S. KentCF KentT Khoussainov B. M. Kierstead H. Kinber E. B. Kjos-Hanssen B. Kleene S. C. Kleinberg E.M. Klette R. Knight J.F. KoKI Kochen S. Kolaitis P.G. Kolmogorov A.N. Kontostathis K. Kramer R. Kreisel G. Kripke S. Kristiansen L. Krom M. Kučera A. Kudinov O.V. Kumabe M. Kumar R. Kummer M. Kurtz S.A. Вернуться на главную страницу