(of a topological space) Such that any two distinct points are topologically distinguishable, i.e., there is an open set containing one of the points which does not contain the other point.

Informally, the property of a string being not longer than any computer program that can produce that string; that is, the property of a string being incompressible.

(computing theory) The complexity of an information object—such as a book or an image—informally defined as the length of the shortest program that produces that information object.

plural of Kolmogorov complexity

(topology) A topological space for which any pair of distinct points are also topologically distinct, i.e., there is an open set which contains one of the points but not the other one.

plural of Kolmogorov space

Synonym of kriging

Of or relating to Andrey Kolmogorov (Андре́й Колмого́ров, 1903–1987), Soviet mathematician.