FPF:UIN1018 Theory of Computability and Co - Course Information
UIN1018 Theory of Computability and Complexity
Faculty of Philosophy and Science in OpavaWinter 1993
- 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
- UIAI019 Fundamentals of Theoretical Computer Science II || UIAI219 Fundamentals of Theoretical Computer Science II || UIBUC09 Theory of languages and automata II || UINK106 Theory of languages and automata II || UIN1006 Theory of Languages and Automata II
- 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 1993, recent)
- Permalink: https://is.slu.cz/course/fpf/winter1993/UIN1018