T-Complexity and T-Information Theory – an

Abstract

This paper describes the derivation of the T-complexity and T-information 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. 1 A brief introduction to T-codes This paper first gives an introduction to T-codes and their construction technique, as this is fundamental for the understanding of the T-decomposition algorithm that underpins the T-complexity measure. It also assists in its physical interpretation. T-codes [3, 4, 11] are similar to Huffman codes in that they are codes wit