AbstractWe present a brief survey of results on relations between the Kolmogorov complexity of infinite strings and several measures of information content (dimensions) known from dimension theory, information theory or fractal geometry.Special emphasis is placed on bounds on the complexity of strings in constructively given subsets of the Cantor space. Finally, we compare the Kolmogorov complexity to the subword complexity of infinite strings
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...
Article dans revue scientifique avec comité de lecture.We are concerned with Kolmogorov complexity o...
We present a brief survey of results on relations between the Kolmogorov complexity of infinite stri...
AbstractWe present a brief survey of results on relations between the Kolmogorov complexity of infin...
AbstractIn this paper various relationships between the Kolmogorov complexity of infinite strings an...
AbstractThe paper investigates bounds on various notions of complexity for ω–languages. We understan...
AbstractWe apply results on extracting randomness from independent sources to “extract” Kolmogorov c...
The resource bounded Kolmogorov complexity classes identify finite strings (and by extension infini...
We consider sets of strings with high Kolmogorov complexity, mainly in resource-bounded settings but...
In this paper we define a generalized, two-parameter, Kolmogorov complexity of finite strings which...
(eng) We explain the basics of the theory of the Kolmogorov complexity}, also known as algorithmic i...
We explain the basics of the theory of the Kolmogorov complexity}, also known as algorithmic informa...
We explain the basics of the theory of the Kolmogorov complexity}, also known as algorithmic informa...
In 1964 Kolmogorov introduced the concept of the complexity of a finite object (for instance, the wo...
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...
Article dans revue scientifique avec comité de lecture.We are concerned with Kolmogorov complexity o...
We present a brief survey of results on relations between the Kolmogorov complexity of infinite stri...
AbstractWe present a brief survey of results on relations between the Kolmogorov complexity of infin...
AbstractIn this paper various relationships between the Kolmogorov complexity of infinite strings an...
AbstractThe paper investigates bounds on various notions of complexity for ω–languages. We understan...
AbstractWe apply results on extracting randomness from independent sources to “extract” Kolmogorov c...
The resource bounded Kolmogorov complexity classes identify finite strings (and by extension infini...
We consider sets of strings with high Kolmogorov complexity, mainly in resource-bounded settings but...
In this paper we define a generalized, two-parameter, Kolmogorov complexity of finite strings which...
(eng) We explain the basics of the theory of the Kolmogorov complexity}, also known as algorithmic i...
We explain the basics of the theory of the Kolmogorov complexity}, also known as algorithmic informa...
We explain the basics of the theory of the Kolmogorov complexity}, also known as algorithmic informa...
In 1964 Kolmogorov introduced the concept of the complexity of a finite object (for instance, the wo...
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...
Article dans revue scientifique avec comité de lecture.We are concerned with Kolmogorov complexity o...
DOI
Add to ORKG