Add to ORKGInternational audienceWe present several application of simple topological arguments in problems of Kolmogorov complexity. Basically we use the standard fact from topology that the disk is simply connected. It proves to be enough to construct strings with some nontrivial algorithmic properties
In this paper we define a generalized, two-parameter, Kolmogorov complexity of finite strings which...
AbstractWe present a brief survey of results on relations between the Kolmogorov complexity of infin...
Article dans revue scientifique avec comité de lecture.We are concerned with Kolmogorov complexity o...
We present several application of simple topological arguments in problems of Kolmogorov com-plexity...
AbstractThe utility of a Kolmogorov complexity method in combinatorial theory is demonstrated by sev...
AbstractThe notion of Kolmogorov program-size complexity (or algorithmic information) is defined her...
AbstractThe notion of Kolmogorov program-size complexity (or algorithmic information) is defined her...
AbstractConditional Kolmogorov complexity K(x|y) can be understood as the complexity of the problem ...
We describe the properties of various notions of time-bounded Kolmogorov complexity and other connec...
It is a trivial observation that every decidable set has strings of length n with Kolmogorov complex...
Born about three decades ago, Kolmogorov Complexity Theory (KC) led to important discoveries that, i...
Abstract. Topological complexity T C(B) of a space B is introduced by M. Farber to measure how much ...
AbstractIn this paper various relationships between the Kolmogorov complexity of infinite strings an...
We present a brief survey of results on relations between the Kolmogorov complexity of infinite stri...
Every topological space has a Kolmogorov quotient that is obtained by identifying points if they ar...
In this paper we define a generalized, two-parameter, Kolmogorov complexity of finite strings which...
AbstractWe present a brief survey of results on relations between the Kolmogorov complexity of infin...
Article dans revue scientifique avec comité de lecture.We are concerned with Kolmogorov complexity o...
We present several application of simple topological arguments in problems of Kolmogorov com-plexity...
AbstractThe utility of a Kolmogorov complexity method in combinatorial theory is demonstrated by sev...
AbstractThe notion of Kolmogorov program-size complexity (or algorithmic information) is defined her...
AbstractThe notion of Kolmogorov program-size complexity (or algorithmic information) is defined her...
AbstractConditional Kolmogorov complexity K(x|y) can be understood as the complexity of the problem ...
We describe the properties of various notions of time-bounded Kolmogorov complexity and other connec...
It is a trivial observation that every decidable set has strings of length n with Kolmogorov complex...
Born about three decades ago, Kolmogorov Complexity Theory (KC) led to important discoveries that, i...
Abstract. Topological complexity T C(B) of a space B is introduced by M. Farber to measure how much ...
AbstractIn this paper various relationships between the Kolmogorov complexity of infinite strings an...
We present a brief survey of results on relations between the Kolmogorov complexity of infinite stri...
Every topological space has a Kolmogorov quotient that is obtained by identifying points if they ar...
In this paper we define a generalized, two-parameter, Kolmogorov complexity of finite strings which...
AbstractWe present a brief survey of results on relations between the Kolmogorov complexity of infin...
Article dans revue scientifique avec comité de lecture.We are concerned with Kolmogorov complexity o...