ABSTRACT
Almost all the ‘general’ histories of Algorithmic Information Theory/Kolmogorov Complexity leave out Solomonoff’s 1960 paper and it is generally considered to be the mid-1960s that these theories were ‘developed’ and published by Solomonoff, Komogorov, and Chaitin. In 1965, when Chaitin was an 18 year old student at the City College of the C.U.N.Y. system, he submitted two papers to the Journal of the ACM of which one was published in 1966 as the ‘complexity of algorithms following Shannon’s coding concepts’ and the other, published in 1969 that puts forward the idea of ‘Kolmogorov complexity’. Chaitin also mentions himself, Kolmogorov and Martin-Lof, along with Solomonoff, as independent contributors to the development of algorithmic information theory.
