So when you say that K-complexity is like the function that you describe earlier, does that mean that there’s provably no minimum, or does that mean that you can’t prove that the minimal constant for Kolmogorov Complexity exists?
I can accept this as an answer, though you’d have to show why Kolmogorov Complexity’s additive constant lacks a minimum number more than you have in this comment thread.
So when you say that K-complexity is like the function that you describe earlier, does that mean that there’s provably no minimum, or does that mean that you can’t prove that the minimal constant for Kolmogorov Complexity exists?
It’s still possible that I’m misunderstanding the question, but if it means what I think it means, then the answer is “provably no minimum”.
I can accept this as an answer, though you’d have to show why Kolmogorov Complexity’s additive constant lacks a minimum number more than you have in this comment thread.