High Quality Content by WIKIPEDIA articles! In algorithmic information theory (a subfield of computer science), the Kolmogorov complexity of an object, such as a piece of text, is a measure of the computational resources needed to specify the object. It is named after Andrey Kolmogorov, who first published on the subject in 1963.
![История России 6кл [Сборник рассказов]](/static/images/item_no_cover.png)
Оставить комментарий