> Let us look at the above three strings. The first two strings can be described by relatively short computer programs:

> 1. Print “100” 30 times.

> 2. Print the first 25 prime numbers.

> The Kolmogorov complexity of the first string is less than the Kolmogorov complexity of the second string because the first program is shorter than the second program.

The second also abstracts away the concept of prime numbers. All of which have their own Kolmogorov complexity, no? Is there such a thing as talking about local and externalized Kolmogorov complexity? Actually, both assume understanding of multiplication, decimal notation, printing.