|
|
|
||
Last update: T_KTI (01.03.2007)
|
|
||
Last update: T_KTI (27.02.2007)
[1] Ming Li, Paul Vitanyi: An Introduction to Kolmogorov Complexity and Its Applications, Springer, 1997. [2] R. Downey, D. Hirschfeldt: Algorithmic randomness and complexity, draft of book at http://www.mcs.vuw.ac.nz/~downey/ |
|
||
Last update: T_KTI (01.03.2007)
Concepts ?low for random", ?K-trivial". Computationally weak sets from the point of view of algorithmic randomness and their equivalence. Basic properties of K-trivial sets. Applications to recursion theory. Modifications and generalizations of K-trivial sets. |