165

Kolmogorov complexity was originally defined for finitely-representable objects. Later, the definition was extended to real numbers based on the asymptotic behaviour of the sequence of the Kolmogorov complexities of the finitely-representable objects—such as rational numbers—used to approximate them. This idea will be taken further here by extending the definition to functions over real numbers...

We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: randomness and classification. The survey is divided in two parts published in a same volume. Part II is dedicated to the relation between logic and information system, within the scope of Kolmogorov algorithmic informatio...

We have proposed novel measures based on the Kolmogorov complexity for use in complex system behavior studies and time series analysis. We have considered background of the Kolmogorov complexity and also we have discussed meaning of the physical as well as other complexities. To get better insights into the complexity of complex systems and time series analysis we have introduced the three nove...

We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations) in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple representation of integers that we suitably effectivize in order to develop an associated Kolmogorov theory. Such effectivizations are particular instances of a ge...

1 Some Basic Theory 1 1.1 Consistency and Unbiasedness at a Point . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 The Kolmogorov–Smirnov Statistic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 Order Statistics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.4 Proof of the Kolmogorov–Smirnov Theorem . . ....

We study a novel spline-like basis, which we name the falling factorial basis, bearing many similarities to the classic truncated power basis. The advantage of the falling factorial basis is that it enables rapid, linear-time computations in basis matrix multiplication and basis matrix inversion. The falling factorial functions are not actually splines, but are close enough to splines that they...

The Kolmogorov complexity theory emerged in sixties; main definitions were independently found by Ray Solomonoff, A.N. Kolmogorov and G. Chaitin. The motivations for the definition were quite different. For Solomonoff the main goal was inductive inference theory. Kolmogorov's work was closely connected with foundations of probability theory and information theory. Chaitin's studied the length o...

It is known that dimension of a set in a metric space can be characterized in information-related terms – in particular, in terms of Kolmogorov complexity of different points from this set. The notion of Kolmogorov complexity K(x) – the shortest length of a program that generates a sequence x – can be naturally generalized to conditional Kolmogorov complexity K(x : y) – the shortest length of a...