Deterministic computation of complexity, information and entropy
Mark R. Titchener · 2002
A new measure of string complexity (Titchener 1998) for finite strings is presented based on a specific recursive hierarchical string production process. From the maximal bound we deduce a relationship between complexity and total information content.