Sciweavers

Share
CIE
2011
Springer

Towards an Axiomatic System for Kolmogorov Complexity

8 years 7 months ago
Towards an Axiomatic System for Kolmogorov Complexity
Abstract. In [She82], it is shown that four of its basic functional properties are enough to characterize plain Kolmogorov complexity, hence obtaining an axiomatic characterization of this notion. In this paper, we try to extend this work, both by looking at alternative axiomatic systems for plain complexity and by considering potential axiomatic systems for other types of complexity. First we show that the axiomatic system given by Shen cannot be weakened (at least in any natural way). We then give an analogue of Shen’s axiomatic system for conditional complexity. In the second part of the paper, we look at prefix-free complexity and try to construct an axiomatic system for it. We show however that the natural analogues of Shen’s axiomatic systems fail to characterize prefix-free complexity.
Antoine Taveneaux
Added 13 Dec 2011
Updated 13 Dec 2011
Type Journal
Year 2011
Where CIE
Authors Antoine Taveneaux
Comments (0)
books