Table of contents
- GJRoelofs (6 edits)
Content
Overview
Description
This course enters into the theoretical aspects of solving problems by applying algorithms and programs. The following subjects will be presented: mathematical foundations, alphabets and languages, finite automata and regular languages, Turing machines, languages and machines, acceptance and decidability, primitive and partial recursive functions, complexity, time complexity classes, NPproblems, NP-completeness.
Knowledge and understanding
After successful completion of the course the student has gained insight into what problems and functions can basically be solved or computed, the socalled decidable problems and computable functions, and what problems and functions cannot be solved or computed, regardless of the available hardware. He also will have some insight in how efficient computable problems can be computed and how to classify such problems into complexity classes
The knowledge and insight as described above may enable a student to solve practical and theoretical problems.
Making Judgements
The knowledge and insight as described above may help the student to judge whether certain problems are solvable or not solvable at all, and in case of solvability to estimate how much time a solution will take in terms of the parameters of the problem.
Communication
The student has learned how to communicate with experts when studying the mathematical aspects of problem solving.
Skills
The student has learned various skills how to attack mathematically formulated problems.
Comments