Deterministic computation of complexity, information and entropy

M.R. Titchener
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)  
A new measure of string complexity [3] for finite strings is presented based on a specific recursive hierarchical string production process (c. f. [2] ). From the maximal bound we deduce a relationship between complexity and total information content.
doi:10.1109/isit.1998.708931 fatcat:ng6qxbgconecjmfhin6nlxfgai