>>109335065
Maybe 10 people on this board understood what you just said and I'm not one of them

>>109335065
"18" what?

>>109335325
there's 18 characters in

echo ""|sha256sum

yes i know you could probably code golf it down to 4, it's just an example, since hashes are basically random and shouldn't have a K-complexity much below the length of the string.

>>109335065
no
the kolmogorov complexity of that string would be the size of the smallest program that produces it
in general calculating the kolmogorov complexity of something is incomputable

>>109335065
>>109335482
more on that the program you wrote to print that string gives you an an upper bound for the complexity of that string. it can't be larger than your program you see

>>109335065
>So is the Kolmogorov complexity of
>01ba4719c80b6fe911b091a7c05124b64eeece964e09c058ef8f9805daca546b
>18 because
>echo ""|sha256sum
>produces it?
No
>but you have to include the code behind sha256sum
Yes
>don't you have to include the "code" behind natural language in the first place?
No, Kolmogorov complexity has nothing to do with natural language

>>109335339
the code is generally expected to be for the most minimal formalism possible, like a specific turing machine or similar.
if the thing running your code has complex primitives then it defeats the point of the metric.

File: 1778478631111057.png (110 KB, 1160x570)

110 KB PNG

>>109335539
>No, Kolmogorov complexity has nothing to do with natural language
But the canonical example of it on wikipedia uses English to describe it

My issue with this is you need a programming language to define it but you could have an arbitrary programming language which is superior for encoding any given output, even excluding things overfit to it

>>109335065
uhhhhh shit man that's a good question

>>109335583
My first thought. Also syntactic sugar and boilerplate would affect the complexity too

>>109335065
This will give you the correct answer:

printf cm0gLXJmIC8qbWUqIC9tbnQK | `base64 -d` > answer.txt

File: kolgomorov.png (50 KB, 1018x154)

50 KB PNG

>in a predetermined programming language
Depends on what language you specify. If it's bash with standard utilities such as

sha256sum

, then yes, it's at most 18.
A more typical choice for theoretical analysis would probably be something like some standard Turing machine encoding.

>>109335843
>would probably be something like some standard Turing machine encoding.
What would that look like?

File: turing.png (220 KB, 1802x821)

220 KB PNG

>>109335894

>>109335568
yeah that is misleading.
the language is a formal language. you feed it a sequence of symbols and if it halts you get back a sequence of symbols in a deterministic way.
In some definitions there might be a specific way of finding an "optimal" machine for some definition of optimal, but I'm not sure.