FPF:UIN1018 Theory of Computability and Co - Course Information
UIN1018 Theory of Computability and Complexity
Faculty of Philosophy and Science in OpavaWinter 2002
- Extent and Intensity
- 2/2/0. 6 credit(s). Type of Completion: zk (examination).
- Guaranteed by
- prof. RNDr. Alice Kelemenová, CSc.
Institute of Computer Science – Faculty of Philosophy and Science in Opava - Prerequisites (in Czech)
- UIAI019 Základy teoretické informatiky II || UIAI219 Základy teoretické informatiky II || UIBUC09 Theory of Languages and Automa || UINK106 Theory of Languages and Automa || UIN1006 Theory of Languages and Automa
- Course Enrolment Limitations
- The course is offered to students of any study field.
- Language of instruction
- English
- Further Comments
- The course can also be completed outside the examination period.
- Enrolment Statistics (Winter 2002, recent)
- Permalink: https://is.slu.cz/course/fpf/winter2002/UIN1018