Guest lecture
Panu Raatikainen
Helsingin yliopisto, Filosofian laitos
Algorithmic Complexity and Information
Aika Tiistaina 3.11 klo 10 Paikka
Tietojenkäsittelytieteen laitos
Teollisuuskatu 23, huone A516Kieli Esitelmä on suomenkielinen.
Abstract
The widely accepted idea that algorithmic complexity, or Kolmogorov complexity, provides a plausible explication of the notion of information content, is evaluated critically. It is shown that this view is based on serious logical confusions. This approach is compared to the semantic theory of information, and it is argued that the latter approach avoids such problems.