NDAA09007U  Computability and Complexity (CoCo)

Volume 2017/2018
Education

MSc Programme in Computer Science
MSc Programme in Physics

Content

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.

Content:

  • Regular languages
  • Context-free languages
  • Turing machines
  • Decidability
  • Reducibility
  • Complexity
  • Complexity classes (P, NP, PSPACE, EXPSPACE, L, and NL)
  • Intractability
Learning Outcome

At course completion, the successful student will have:

Knowledge of:

  • Computational models such as finite automata, pushdown automata, and Turing machines, the languages recognized 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 analyze 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.


Skills in:

  • 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.


Competences to:

  • 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.

 

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 essential.
Lectures and exercise classes.
Credit
7,5 ECTS
Type of assessment
Written examination, 4 hours under invigilation
All books and notes may be brought to the exam.
Exam registration requirements

Assignments will be made each week and be due in the following week. 5 assignments out of the 7 must be completed by the due date and approved to qualify to take the exam.

Aid
Written aids allowed
Marking scale
7-point grading scale
Censorship form
No external censorship
Several internal examiners
Re-exam

If a student is not qualified then qualification can be achieved by hand-in and approval of equivalent assignments no later than two weeks before the re-exam.

The re-exam will also be a 4 hours written exam, unless there are 10 or fewer students signed up, in which case it will be an oral exam (25 minutes oral exam without preparation).  All aids are allowed at the oral exam.

Criteria for exam assesment

See Learning Outcome.

  • Category
  • Hours
  • Theory exercises
  • 9
  • Lectures
  • 36
  • Exam
  • 4
  • Preparation
  • 157
  • Total
  • 206