On June 23rd former HLRS researcher Colin Glass will join us for a mini workshop on Kolmogorov Complexity. Kolmogorov or Algorithmic Complexity is a complexity measure which can be used to define description independent probability measures on strings and is thereby claimed to measure “information” contained in single strings. It can furthermore be used to develop a framework for inductive inference (PAC-learning) for which it is claimed that it solves the problem of induction by formalizing Occam’s razor and providing an objective universal prior. The aim of this workshop is understanding the technicalities of Kolmogorov Complexity to such an extent that allows one to make sense of these claims.
This mini workshop is an (internal) event taking place at HLRS. Should you want to join please contact firstname.lastname@example.org.