Optimal representation in average using Kolmogorov complexity

• Published in: Theoretical computer science Vol. 200; no. 1; pp. 261 - 287
• Main Authors: Rivals, E., Delahaye, J.P.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 28.06.1998; Elsevier
• Subjects: Algorithmics. Computability. Computer arithmetics; Applied sciences; Automata. Abstract machines. Turing machines; Compression; Computer science; control theory; systems; Data processing. List processing. Character string processing; Exact sciences and technology; Information theory; Kolmogorov complexity; Memory organisation. Data processing; Optimal coding; Software; Theoretical computing; Compression; Optimal coding; Kolmogorov complexity; Information theory; Logical function; Coding; Data compression; Kolmogorov law; Turing machine; Algorithmics; Data processing; Computational complexity

One knows from the Algorithmic Complexity Theory 1 1 This theory is also called the Kolmogorov complexity or Algorithmic Information theory. [2–5, 8, 14] that a word is incompressible on average. For words of pattern x m , it is natural to believe that providing x and m is an optimal average represe...