Sciweavers

COCO
2009
Springer
106views Algorithms» more  COCO 2009»
13 years 12 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day