Computability and Complexity (CoCo)
In computing, there is continual tension between time usage and
space usage, and what can be computed and what cannot be computed
at all. The purpose of this course is to explore these issues.
- Regular languages
- Context-free languages
- Turing machines
- Complexity classes (P, NP, PSPACE, EXPSPACE, L, and NL)
In addition, the course covers topics in complexity that reflect the current state of research as well as instructor and participant backgrounds and interests; the particular topic(s) change from year to year. Please contact the course organizer for more information on the topics covered.
MSc Programme in Computer Science
MSc Programme in Physics
At course completion, the successful student will have:
- Computational models such as finite automata, pushdown automata, and Turing machines, the languages recognised by some of these models, and techniques for showing their limitations, such as the pumping lemmas for regular and for context-free languages.
- The power and limits of algorithmic solvability, with focus on the computationally unsolvable Halting problem.
- The reducibility method for proving that additional problems are computationally unsolvable.
- How to analyse algorithms and their time and space complexity and how to classify problems according to the amount of time and space required to solve them.
- Known computational problems that are solvable in principle but not in practice, i.e. intractable problems.
- Reading and writing specifications of languages using computational models and grammars.
- Classifying given languages according to type (regular, context-free, etc.) and algorithmic problems according to complexity (time and space).
- Showing the equivalence between certain machine models.
- Presenting the relevant constructions and proofs in writing, using precise terminology and an appropriate level of technical detail.
- Reason reliably about language classes and computational models and their strengths and limitations, and about the complexity of algorithms and algorithmic problems.
- Communicate effectively about the theory of computation, both for accessing advanced topics from the research literature, and convincingly presenting the results of own work.
Lectures and exercise classes.
Is expected to be: Introduction to the Theory of Computation, Michael Sipser, International third edition. See Absalon when the course is set up.
Basic algorithms and discrete mathematics course(s). The course
"Logic in Computer Science" would be useful, but is not
Academic qualifications equivalent to a BSc degree is recommended.
PhD’s can register for MSc-course by following the same procedure as credit-students, see link above.
- 7,5 ECTS
- Type of assessment
Written examination, 4 hours under invigilation
- Type of assessment details
- All books and notes may be brought to the exam.
- Written aids allowed
- Marking scale
- 7-point grading scale
- Censorship form
- No external censorship
Several internal examiners
Criteria for exam assessment
See Learning Outcome.
Single subject courses (day)
- Theory exercises
- Course number
- 7,5 ECTS
- Programme level
- Full Degree Master
- Block 3
- No limit
The number of seats may be reduced in the late registration period
- Study Board of Mathematics and Computer Science
- Department of Computer Science
- Faculty of Science
- Christian Wulff-Nilsen (7-7d81817e81818c52767b407d8740767d)
Are you BA- or KA-student?
Courseinformation of students