Q How do I quantify complexity of a given string? Consider a sample:
AAAAAAAAA //very easy - meta sample [COMPLEXITY = 0] KEui£$n9&E //say random - meta sample [COMPLEXITY = ∞]
To my limited knowledge Kolmogorov Complexity deals with this problem, but it is non-computable. So what measures I can use to approximate the complexity of the string? Could you point me to the right direction or literature for the following problem.