| 
|
QuoteRef: chaiGJ_1970
topics >
all references >
ThesaHelp:
references c-d
Topic:
Kolmorgorov and algorithmic complexity
Topic:
randomness
Reference
Chaitin, G.J., "On the difficulty of computations", IEEE Transactions on Information Theory, IT-16, pp. 5-9, 1970. Google
Other Reference
page numbers from Chaitin, G.J., Information, randomness & incompleteness, Singapore: World Scientific, p. 14-22, 1987.
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
ThesaHelp: references c-d (337 items)
Topic: Kolmorgorov and algorithmic complexity (10 items)
Topic: randomness (16 items)