June 16, 2014

Anatol Slissenko (LACL - UPEC)

The problem of measuring the information extracted by an algorithm when it computes a function, is of evident theoretical interest. Approaches to find methods of measuring this information, and arising difficulties, constitute the topic of the talk. Entropic convergence of algorithm is the main concept to discuss. This convergence will be defined for concrete combinatorial algorithms (the general theory is not yet developed).