Exact Schedule unknown    

Description

• Logic, automata and context free languages.
• Turing machines. Turing machines build on automata to make it possible to build more elaborate proofs.
• Computability and Complexity theory. Does a problem have an answer? Is the problem well formulated? How can we determine a priori the level of difficulty of a problem?
• Analysis of algorithms.

3 ECTS

Prof. Daniele Catanzaro

See the full course description here