Also, to clarify. Kolmogorov’s complexity of printing out primes vs printing this exact sequence followed by ones, is a matter of language. One could imagine a language where there’s 1-symbol command that prints primes. Or a language that is like actual programming languages, where you have to implement printing of primes.
It is generally assumed that the program that returns a predefined sequence and then always “1” is negligibly longer than that sequence.
Precisely.
Also, to clarify. Kolmogorov’s complexity of printing out primes vs printing this exact sequence followed by ones, is a matter of language. One could imagine a language where there’s 1-symbol command that prints primes. Or a language that is like actual programming languages, where you have to implement printing of primes.