|
|
|
||
Last update: T_KTI (20.04.2004)
|
|
||
Last update: RNDr. Jan Hric (07.06.2019)
To learn fundamentals of recursion theory |
|
||
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 Logic Guides. Oxford University Press, Oxford, 2009.
R. Downey, D. Hirschfeldt, Algorithmic randomness and complexity, Springer, 2010
P. Odifreddi: Classical recursion theory. North-Holland, 1989
R.I. Soare: Recursively enumerable sets and degrees. Springer-Verlag, 1987
M. Li, P. Vitanyi: An introduction to Kolmogorov complexity and its applications. Springer-Verlag, 1997 |
|
||
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)
|
|
||
Last update: T_KTI (29.04.2015)
Znalosti na úrovni přednášky Vyčíslitelnost |