>>13693143>If Kolmogorov complexity is a measure of length of a computer program,It's not, it's a measure of the ratio between the length of the computer program AND the results produced by that program.
I think what he was saying is that the equation to work out pi is really concise it's just divide the Circumference by the Diameter but you end up with this crazy long sequence of digits, so it has high complexity.
I don't understand why but he's saying that the shorter 'program' is less arbitrary than the equation itself.
A much much longer program if it produced a crazy long sequence of digits would also have high complexity, because it's about the ratio.
> I assume Kolmgorov complexity is meant to only be an informal and rough approximationConventional Arithmetic?
