UIAI232 Theory of Computability and Complexity

Faculty of Philosophy and Science in Opava
Winter 2013
Extent and Intensity
0/0. 6 credit(s). Type of Completion: zk (examination).
Teacher(s)
doc. Ing. Petr Sosík, Dr. (lecturer)
RNDr. Miroslav Langer, Ph.D. (seminar tutor)
Guaranteed by
doc. Ing. Petr Sosík, Dr.
Institute of Computer Science – Faculty of Philosophy and Science in Opava
Prerequisites (in Czech)
! UINK118 Computability and Complexity T
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Course objectives
Abstract machine models of computation - the Turing Machine and the RAM - are introduced. The concept of machine computability is built on their basis. The existence of non-computable problems is proven and their examples given. In the second part of the course, asymptotical time and space complexity of algorithms is introduced. This allows to describe the consumption of time and space of algorithms without fixing to any particular computing machine. Elementary complexity classes and their properties are studied, with special emphasis on the classes P and NP.
Language of instruction
Czech
Further comments (probably available only in Czech)
The course can also be completed outside the examination period.
Information on the extent and intensity of the course: Přednáška 2 HOD/SEM, Cvičení 2 HOD/SEM.
Teacher's information
Course-credit:
- construction of a Turing machine due to an individual assignment
- at least 50% evaluation of written tests in the seminar classes
Exam:
- at least 50% evaluation of the written final test including the whole course topics
The course is also listed under the following terms Winter 2012.
  • Enrolment Statistics (recent)
  • Permalink: https://is.slu.cz/course/fpf/winter2013/UIAI232