Skip to main content

Advanced Discrete Optimization

lourim | Louvain-la-Neuve, Mons

lourim
29 June 2026 , modified on 1 July 2026

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

 

Évènement associé

Placeholder image
Doctoral course : Advanced Discrete Optimization
01 Sep
Exact Schedule unknown     DescriptionLogic, 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 ECTSProf.
Placeholder image
Doctoral course : Advanced Discrete Optimization
01 Sep
Exact Schedule unknown     DescriptionLogic, 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 ECTSProf.