Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Recursion 2 - NTIN074

Title:	Rekurze 2
Guaranteed by:	Department of Theoretical Computer Science and Mathematical Logic (32-KTIML)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2020
Semester:	summer
E-Credits:	4
Hours per week, examination:	summer s.:2/1, C+Ex [HT]
Capacity:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	not taught
Language:	Czech
Teaching methods:	full-time
Teaching methods:	full-time

Guarantor:	doc. RNDr. Antonín Kučera, CSc.
Class:	Informatika Mgr. - Teoretická informatika
Classification:	Informatics > Theoretical Computer Science
Co-requisite :	NTIN073

Annotation -

Last update: T_KTI (20.04.2004)

A continuation of Recursion Theory I. Other forcing techniques. Algorithmic randomness. Kolmogorov complexity.

Aim of the course - Czech

Last update: T_KTI (23.05.2008)

Naučit další cásti z teorie rekurze

Literature - Czech

Last update: T_KTI (20.04.2004)

Demuth O., Kryl R., Kučera A.: Teorie algoritmů I,II. SPN, 1984, 1989

Soare R.I.: Recursively enumerable sets and degrees. Springer-Verlag, 1987

Odifreddi P.: Classical recursion theory. North-Holland, 1989

Li M., Vitanyi P.: An introduction to Kolmogorov complexity and its applications.

Springer-Verlag, 1997

Syllabus -

Last update: T_KTI (20.04.2004)

Minimal degrees.

Algorithmic randomness. Properties of 1-random sets and their degrees.

Kolmogorov complexity. Martingales.