today's meeting

[Alexander Shen]

sorry for late announcement, but I will try to discuss today the exact
definitions of Kolmogorov complexity function - do we use universal or
optimal algorithms? It turns out that this is (except for conditional
prefix complexity, where it is not clear) the same class of complexity
functions. We also will discuss how "robust" are the statements and
whether we can hope to get "reasonable" constants in the optimality
theory, and what can we do if we apply Kolmogorov complexity arguments
to prove combinatorial statements.

Zoom link:
https://u-bordeaux-fr.zoom.us/j/88402787361?pwd=WktCdEhBT3pXN0pLUGg4Z3RuMlpsQT09
<https://www.google.com/url?q=https://u-bordeaux-fr.zoom.us/j/88402787361?pwd%3DWktCdEhBT3pXN0pLUGg4Z3RuMlpsQT09&sa=D&source=calendar&usd=2&usg=AOvVaw3j-bl7JAYbHGHxleFDH1H4>