| 
|
QuoteRef: chaiGJ_1966
topics >
all references >
ThesaHelp:
ACM references a-e
ThesaHelp:
references c-d
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. 547-569, 1966. Google
Other Reference
page numbers from Chaitin, G.J., Information, randomness & incompleteness, Singapore: World Scientific, p. 213-238, 1987.
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
ThesaHelp: ACM references a-e (259 items)
ThesaHelp: references c-d (337 items)
Topic: randomness (16 items)
Topic: Kolmorgorov and algorithmic complexity (10 items)