Subjects

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

Computability - NUIN007

Title:	Vyčíslitelnost
Guaranteed by:	Department of Theoretical Computer Science and Mathematical Logic (32-KTIML)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2005
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:	cancelled
Language:	Czech
Teaching methods:	full-time
Teaching methods:	full-time

Guarantor:	doc. RNDr. Vítězslav Švejdar, CSc.
Classification:	Informatics > Theoretical Computer Science
Is incompatible with:	NLTM020

Opinion survey results Examination dates Schedule Noticeboard

Annotation -

Last update: T_KTI (23.04.2001)

Partial recursive functions as a basic computational model, some other computational model (Turing machines or flowchart diagrams), their equivalence. The Normal Form Theorem, recursively enumerable sets and the Halting Problem, m-reducibility and m-completeness, productive sets, Rice's Theorem, some connections to logic.

Syllabus -

Last update: G_I (17.05.2004)

Partial recursive functions as a basic computational model,

some other computational model (Turing machines or flowchart

diagrams), their equivalence. The Normal Form Theorem,

recursively enumerable sets and the Halting Problem,

m-reducibility and m-completeness, productive sets, Rice's

Theorem, some connections to logic.