Journal: Theoretical Computer Science

Volume 271, Issue 1-2

1 -- 0Bruno Durand. Kolmogorov Complexity - Foreword
3 -- 14Cristian Calude. A characterization of c.e. random reals
15 -- 35Andrei A. Muchnik, Semen Ye. Positselsky. Kolmogorov entropy in the context of computability theory
37 -- 46Bruno Durand, Sylvain Porrot. Comparison between the complexity of a function and the complexity of its graph
47 -- 58Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin. Descriptive complexity of computable sequences
59 -- 67Nikolai K. Vereshchagin. Kolmogorov complexity conditional to large integers
69 -- 95Alexey V. Chernov, Andrei A. Muchnik, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin. Upper semi-lattice of binary strings with the relation x is simple conditional to y
97 -- 109Andrei A. Muchnik. Conditional complexity and codes
111 -- 123Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin. Combinatorial interpretation of Kolmogorov complexity
125 -- 129Alexander Shen, Nikolai K. Vereshchagin. Logical operations and Kolmogorov complexity
131 -- 143Nikolai K. Vereshchagin, Michael V. Vyugin. Independent minimum length programs to translate between given strings
145 -- 150Michael V. Vyugin. Information distance and conditional complexities
151 -- 180Serge Grigorieff, Jean-Yves Marion. Kolmogorov complexity and non-determinism
181 -- 200Yuri Kalnishkan. General linear relations between different types of predictive complexity