ThesaHelp: references cd
Topic: Kolmorgorov and algorithmic complexity
Topic: randomness
 
Reference
Chaitin, G.J.,
"On the difficulty of computations",
IEEE Transactions on Information Theory, IT16, pp. 59, 1970.
Google
Other Reference
page numbers from Chaitin, G.J., Information, randomness & incompleteness, Singapore: World Scientific, p. 1422, 1987.
Quotations
16 ;;Quote: most binary sequences require programs of the same size; the number generated by smaller programs decreases exponentially; gives proof
 17 ;;Quote: random sequences are those that require the longest programs; not random if generated by a short program
 18 ;;Quote: the fastest way to calculate a infinite subset of a perfect, infinite set of numbers is to calculate the whole set; such sets exist

Related Topics
ThesaHelp: references cd (337 items)
Topic: Kolmorgorov and algorithmic complexity (10 items)
Topic: randomness (16 items)
