7 Nov 2012 sness   » (Journeyer)

T-Complexity and T-Information Theory -- an Executive Summary

T-Complexity and T-Information Theory -- an Executive Summary: "T-Complexity and T-Information Theory -- an Executive Summary
Gunther, Ulrich
Identifier: http://hdl.handle.net/2292/3657
Issue Date: 2001-02
Reference: CDMTCS Research Reports CDMTCS-149 (2001)
Rights: The author(s)
Rights (URI): https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm
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. It is intended
as a summary of work published mainly by Titchener and Nicolescu.
Show full item record


'via Blog this'

Syndicated 2012-11-06 23:08:00 from sness

Latest blog entries     Older blog entries

New Advogato Features

New HTML Parser: The long-awaited libxml2 based HTML parser code is live. It needs further work but already handles most markup better than the original parser.

Keep up with the latest Advogato features by reading the Advogato status blog.

If you're a C programmer with some spare time, take a look at the mod_virgule project page and help us with one of the tasks on the ToDo list!