Volume 271; Issue 1-2

Theoretical Computer Science

Volume 271; Issue 1-2
1

Foreword

Year:
2002
Language:
english
File:
PDF, 31 KB
english, 2002
2

A characterization of c.e. random reals

Year:
2002
Language:
english
File:
PDF, 121 KB
english, 2002
3

Kolmogorov entropy in the context of computability theory

Year:
2002
Language:
english
File:
PDF, 172 KB
english, 2002
4

Comparison between the complexity of a function and the complexity of its graph

Year:
2002
Language:
english
File:
PDF, 111 KB
english, 2002
5

Descriptive complexity of computable sequences

Year:
2002
Language:
english
File:
PDF, 135 KB
english, 2002
6

Kolmogorov complexity conditional to large integers

Year:
2002
Language:
english
File:
PDF, 97 KB
english, 2002
8

Conditional complexity and codes

Year:
2002
Language:
english
File:
PDF, 117 KB
english, 2002
9

Combinatorial interpretation of Kolmogorov complexity

Year:
2002
Language:
english
File:
PDF, 127 KB
english, 2002
10

Logical operations and Kolmogorov complexity

Year:
2002
Language:
english
File:
PDF, 79 KB
english, 2002
12

Information distance and conditional complexities

Year:
2002
Language:
english
File:
PDF, 73 KB
english, 2002
13

Kolmogorov complexity and non-determinism

Year:
2002
Language:
english
File:
PDF, 216 KB
english, 2002
14

General linear relations between different types of predictive complexity

Year:
2002
Language:
english
File:
PDF, 203 KB
english, 2002
15

Author index

Year:
2002
Language:
english
File:
PDF, 33 KB
english, 2002