|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ИНХС РАН |
||
Complexity and entropy: An introduction to the theory of Kolmogorov complexityстатья
- Автор: Uspensky Vladimir A.
- Сборник: Kolmogorov Complexity and Computational Complexity
- Серия: EATCS Monographs on Theoretical Computer Science
- Глава в коллективной монографии
- Год издания: 1992
- Место издания: Springer
- Первая страница: 85
- Последняя страница: 102
- DOI: 10.1007/978-3-642-77735-6_6
- Аннотация: Things can be large or small, and their size (the length or the volume or the weight or so on) can be measured by a number. Besides, things can be simple or complex, and their complexity can also be measured by a number. I do not know to whom we are indebted for measuring sizes by numbers. It was Andrei Kolmogorov who proposed to measure the complexity of a thing by a natural number (i.e., a non-negative integer), and he developed the rudiments of the theory. Preparation of this paper was supported in part by the Institute of New Technologies at Moscow.
- Добавил в систему: Успенский Владимир Андреевич