In our case, we are just looking for a canonical complexity measure for finite strings.
I see what you’re saying, of course; but isn’t that like saying that you only want a canonical measure of the length of a message, not its improbability?
I see what you’re saying, of course; but isn’t that like saying that you only want a canonical measure of the length of a message, not its improbability?