|
|
|
||
Last update: T_KTI (29.04.2015)
|
|
||
Last update: doc. RNDr. Antonín Kučera, CSc. (02.11.2019)
To learn fundamentals of algorithmic randomness |
|
||
Last update: doc. RNDr. Antonín Kučera, CSc. (07.06.2019)
Oral examination |
|
||
Last update: T_KTI (29.04.2015)
Nies, Computability and randomness, Oxford University Press, 2009
R. Downey, D. Hirschfeldt, Algorithmic randomness and complexity, Springer, 2010
Ming Li, Paul Vitanyi, An Introduction to Kolmogorov Complexity and Its Applications, 3rd edition, Springer, 2008
|
|
||
Last update: doc. RNDr. Antonín Kučera, CSc. (09.10.2017)
The course is finished by an oral examination.
Requirements at the oral examination correspond to the syllabus of the subject. |
|
||
Last update: T_KTI (30.04.2015)
Typicalness - measure theory, martingales
Incompressibility - Kolmogorov complexity
|
|
||
Last update: T_KTI (29.04.2015)
Znalosti na úrovni přednášky Rekurze |