Algorithmic information theory AIT
<p>Jul 02, 2011 06:00 PM
 
<b>AIT = algo info theory..</b>.  complexity on strings.
 
info = concept of compressibility.
 
according to AIT,  the info in a string = shortest possible self-contained repres of that string.
 
Ths sntnc hs lw nfrmtn cntnt  this sentence has low information content.
 
random letters may have more information but the encyclopedia has more useful information.
 
 
 
<b>Kolmogorov complexity of a string is invariant</b> up to an additive constant depending only on the choice of universal Turing machine. For this reason the set of random infinite sequences is independent of the choice of universal machine.
 
Algorithmic information theory was founded by <a title="Ray Solomonoff" href="/wiki/Ray_Solomonoff">Ray Solomonoff</a><sup id="cite_ref-1" class="reference"><a href="#cite_note-1">[2]</a></sup>, who published the basic ideas on which the field is based as part of his invention of <a title="Algorithmic probability" href="/wiki/Algorithmic_probability">algorithmic probability</a> - a way to overcome serious problems associated with the application of Bayes rules in statistics. He first described his results at a Conference at <a class="mw-redirect" title="Caltech" href="/wiki/Caltech">Caltech</a> in 1960,<sup id="cite_ref-2" class="reference"><a href="#cite_note-2">[3]</a></sup> and in a report, Feb. 1960, "A <b>Preliminary Report on a General Theory of Inductive Inference.</b>"<sup id="cite_ref-3" class="reference"><a href="#cite_note-3">[4]</a></sup> Algorithmic information theory was later developed independently by <a title="Andrey Kolmogorov" href="/wiki/Andrey_Kolmogorov">Andrey Kolmogorov</a>, in 1965 and <a title="Gregory Chaitin" href="/wiki/Gregory_Chaitin">Gregory Chaitin</a>, around 1966.
 
 </p>