| http://www.w3.org/ns/prov#value | - Roughly speaking, the Kolmogorov information in (or complexity of) a string x of symbols is the length of the shortest program P and input I such that P outputs x on input I. For example, the Kolmogorov complexity of a bit string of length n that starts 01101010001..., where bit i is 1 if i is a prime and 0 otherwise, is bounded above by log2 n + C, where C is a constant that takes into account th
|
