T-Complexity and T-Information Theory--an Executive Summary, 2nd revised version
Ulrich Speidel · ResearchSpace (University of Auckland) · 2006
This paper describes the derivation of the T-complexity and T-in- formation theory from the decomposition of finite strings, based on the duality of strings and variable-length T-codes. It further outlines its similarity to the string parsing algorithm by Lempel and Ziv. In its first version [15], it was intended as a summary of work published mainly by Titchener and Nicolescu. Apart from minor corrections, the present extended version incorporates feedback from previous readers and presents new results obtained since.