1. В. В. Вьюгин, В. П. Маслов, “Об экстремальных соотношениях между аддитивными функциями потерь и колмогоровской сложностью”, Пробл. передачи информ., 39:4 (2003), 71–87  mathnet  mathscinet  zmath; V. V. V'yugin, V. P. Maslov, “On Extremal Relations between Additive Loss Functions and the Kolmogorov Complexity”, Problems Inform. Transmission, 39:4 (2003), 380–394  crossref
  2. An. Muchnik, A. Semenov, M. Ushakov, “Almost periodic sequences”, Theoretical Computer Science, 304:1-3 (2003), 1  crossref
  3. Bruno Durand, Vladimir Kanovei, Vladimir A. Uspensky, Nikolai Vereshchagin, “Do stronger definitions of randomness exist?”, Theoretical Computer Science, 290:3 (2003), 1987  crossref
  4. Wolfgang Merkle, “The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences”, J. symb. log, 68:04 (2003), 1362  crossref
  5. Wolfgang Merkle, Jan Reimann, Lecture Notes in Computer Science, 2747, Mathematical Foundations of Computer Science 2003, 2003, 602  crossref
  6. Sérgio B. Volchan, “What Is a Random Sequence?”, The American Mathematical Monthly, 109:1 (2002), 46  crossref
  7. Wolfgang Merkle, Lecture Notes in Computer Science, 2380, Automata, Languages and Programming, 2002, 390  crossref
  8. В. В. Вьюгин, “О неустойчивости индивидуальной эргодической теоремы”, Пробл. передачи информ., 37:2 (2001), 27–39  mathnet  mathscinet  zmath; V. V. V'yugin, “Nonrobustness Property of the Individual Ergodic Theorem”, Problems Inform. Transmission, 37:2 (2001), 108–119  crossref
  9. J.-C. Dubacq, B. Durand, E. Formenti, “Kolmogorov complexity and cellular automata classification”, Theoretical Computer Science, 259:1-2 (2001), 271  crossref
  10. Vladimir A. Uspensky, Nonlinear Phenomena and Complex Systems, 6, Complex Systems, 2001, 201  crossref
  11. Julien Cervelle, Bruno Durand, Enrico Formenti, Lecture Notes in Computer Science, 2136, Mathematical Foundations of Computer Science 2001, 2001, 248  crossref
  12. M. Minozzo, “Purely Game-theoretic Random Sequences: I. Strong Law of Large Numbers and Law of the Iterated Logarithm”, Theory Probab Appl, 44:3 (2000), 511  mathnet  crossref  mathscinet  isi  elib
  13. Jack H. Lutz, David L. Schweizer, “Feasible reductions to kolmogorov-loveland stochastic sequences”, Theoretical Computer Science, 225:1-2 (1999), 185  crossref
  14. V. V. V'yugin, “On the Longest Head-Run in an Individual Random Sequence”, Theory Probab Appl, 42:3 (1998), 541  mathnet  crossref  mathscinet  isi
  15. V. V. V'yugin, “Effective Convergence in Probability and an Ergodic Theorem forIndividual Random Sequences”, Theory Probab Appl, 42:1 (1998), 39  mathnet  crossref  mathscinet  isi
  16. V.V. V'yugin, “Ergodic theorems for individual random sequences”, Theoretical Computer Science, 207:2 (1998), 343  crossref
  17. V.V. V'yugin, “Non-stochastic infinite and finite sequences”, Theoretical Computer Science, 207:2 (1998), 363  crossref
  18. Andrei A. Muchnik, Alexei L. Semenov, Vladimir A. Uspensky, “Mathematical metaphysics of randomness”, Theoretical Computer Science, 207:2 (1998), 263  crossref
  19. Jonathan D. H. Smith, Evolutionary Systems, 1998, 141  crossref
  20. Nancy Oppenheimer-Marks, Peter E. Lipsky, T Cells in Arthritis, 1998, 129  crossref
Предыдущая
1
2
3
4
Следующая