In algorithmic information theory, the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program that produces the object as output.
Preferred languages to be displayed in the selection menus
Please note that, in order to improve your browsing experience on this website,
BabelNet® uses various types of cookies, including: browsing functionality,
performance and statistical cookies.
By continuing to browse the site you are agreeing to our use of cookies.
OK
