Title :
Deterministic computation of complexity, information and entropy
Author :
Titchener, Mark R.
Author_Institution :
Dept. of Comput. Sci., Auckland Univ., New Zealand
Abstract :
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
Keywords :
computational complexity; entropy; information theory; complexity; deterministic computation; entropy; finite strings; information; maximal bound; recursive hierarchical string production process; total information content; Computer science; Context modeling; Entropy; Network address translation; Production; Upper bound;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708931
