|
|
Publications in Math-Net.Ru
-
Lattice of Definability in the Order of Rational Numbers
Mat. Zametki, 108:1 (2020), 102–118
-
Algorithmic aspects of decomposition and equivalence of finite-valued transducers
Probl. Peredachi Inf., 51:3 (2015), 70–92
-
Determinization of ordinal automata
Probl. Peredachi Inf., 49:2 (2013), 58–72
-
Kolmogorov complexity and cryptography
Trudy Mat. Inst. Steklova, 274 (2011), 210–221
-
On joint conditional complexity (entropy)
Trudy Mat. Inst. Steklova, 274 (2011), 103–118
-
Stability of properties of Kolmogorov complexity under relativization
Probl. Peredachi Inf., 46:1 (2010), 42–67
-
Algorithmic randomness and splitting of supermartingales
Probl. Peredachi Inf., 45:1 (2009), 60–70
-
Sequences close to periodic
Uspekhi Mat. Nauk, 64:5(389) (2009), 21–96
-
On the Role of the Law of Large Numbers in the
Theory of Randomness
Probl. Peredachi Inf., 39:1 (2003), 134–165
-
A class of enumerable sets
Uspekhi Mat. Nauk, 54:3(327) (1999), 171–172
-
Lower Limits of Frequences for Computable Sequences and Relativitized a priori Probabilities
Teor. Veroyatnost. i Primenen., 32:3 (1987), 563–565
-
The basic structures of the descriptive theory of algorithms
Dokl. Akad. Nauk SSSR, 285:2 (1985), 280–283
© , 2024