Subjects

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

Computability 2 - NTIN065

Title:	Vyčíslitelnost 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:	3
Hours per week, examination:	summer s.:2/0, 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

Guarantor:	doc. RNDr. Antonín Kučera, CSc.
Class:	Informatika Mgr. - Teoretická informatika Informatika Mgr. - Diskrétní modely a algoritmy
Classification:	Informatics > Theoretical Computer Science
Co-requisite :	NTIN064

Opinion survey results Examination dates Schedule Noticeboard

Annotation -

A continuation of Computability I. Various types of computably enumerable sets. A connection to mathematical logic. Relative computability. Jump operation. Arithmetical hierarchy.

Last update: T_KTI (20.04.2004)

Aim of the course - Czech

Naučit další navazující teorii vyčíslitelnosti

Last update: T_KTI (23.05.2008)

Literature -

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

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

Last update: T_KTI (29.04.2015)

Syllabus -

Simple sets.

Relative computability, T-reducibility.

Jump operation, basic properties. Limit computability.

Arithmetical hierarchy, basic properties. Applications of the theory of computability.

Last update: T_KTI (20.04.2004)