|
|
|
||
Last update: T_KTI (30.04.2015)
|
|
||
Last update: RNDr. Jan Hric (07.06.2019)
To learn fundamentals of computability |
|
||
Last update: doc. RNDr. Antonín Kučera, CSc. (07.06.2019)
Oral examination |
|
||
Last update: T_KTI (29.04.2015)
Soare R. I.: Recursively enumerable sets and degrees. Springer-Verlag, 1987
Odifreddi P.: Classical recursion theory. North-Holland, 1989
S.B. Cooper. Computability Theory Chapman Hall, 2003
Nies. Computability and randomness, Oxford Logic Guides. Oxford University Press, Oxford, 2009
R. Downey, D. Hirschfeldt. Algorithmic randomness and complexity. Theory and Applications of Computability. Springer, New York, 2010
A. Shen, N. Vereshchagin. Computable functions, Student Mathematical Library, vol. 19, AMS, 2003
|
|
||
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)
Introduction to computability
Relative computability
|
|
||
Last update: doc. RNDr. Antonín Kučera, CSc. (14.02.2022)
A basic knowledge of computability equivalent to course NTIN090 (or NTIX090) |