Course - Theory of Computability and Complexity - MA2301
MA2301
Theory of Computability and Complexity
Credits
7.5
Level
Intermediate course, level II
Course start
Autumn 2010
Duration
1 semester
Examination arrangement
Written examination
About
About the course
Course content
This course provides parts of the theoretical background for computer science. The course includes formal languages, finite automata, Turing machines, computability, polynomical reduction and complexity-classes with examples. The course will be lectured every second year, next time autumn 2010.
Learning outcome
The course is focused on the theory of formal languages and
algorithms with the goal to discuss the mathematical approach to complexity computationis which is important in connection with programming and information technology.
Learning methods and activities
Lectures and exercises.
Recommended previous knowledge
The course is based on MA0301 Elementary discrete mathematics or TMA4140 Discrete mathematics.
Course materials
Will be announced at the start of the course.
Subject areas
- Informatics
- Mathematics
Contact information
Course coordinator
Department with academic responsibility
Examination
Examination
Examination arrangement: Written examination
Grade: Letters
Ordinary examination - Autumn 2010
Written examination
Weighting
100/100
Date
2010-12-10
Time
09:00
Duration
4 timer
Place and room
Not specified yet.
Ordinary examination - Spring 2011
Written examination
Weighting
100/100
Date
2011-06-07
Time
09:00
Duration
4 timer
Place and room
Not specified yet.