160 search results - page 2 / 32 » Some Theorems on the Algorithmic Approach to Probability The... |
JCST
2010
13 years 2 days ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
COCO
2009
Springer
13 years 12 months ago
2009
Springer
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...
APAL
2006
13 years 5 months ago
2006
This paper uses the locale theory approach to topology. Two descriptions are given of all locale limits, the first description using suplattice constructions and the second prefra...
DAM
2008
13 years 5 months ago
2008
We report on ideas, problems and results, which occupied us during the past decade and which seem to extend the frontiers of information theory in several directions. The main con...
ITP
2010
13 years 7 months ago
2010
Lebesgue integration is a fundamental concept in many mathematical theories, such as real analysis, probability and information theory. Reported higher-order-logic formalizations o...