ThesaHelp: ACM references ae
ThesaHelp: references cd
Topic: randomness
Topic: Kolmorgorov and algorithmic complexity
 
Reference
Chaitin, G.J.,
"On the length of programs for computing finite binary sequences",
Journal of the ACM, 13, pp. 547569, 1966.
Google
Other Reference
page numbers from Chaitin, G.J., Information, randomness & incompleteness, Singapore: World Scientific, p. 213238, 1987.
Quotations
236 ;;Quote: a random, finite binary sequence is one that requires a program at least as long as for any other sequence of the same length

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