| 
|
QuoteRef: chaiGJ_2001
topics >
all references >
Topic:
randomness
Topic:
chaotic behavior
Group:
philosophy of mathematics
Topic:
Turing machine
Group:
information
Topic:
Kolmorgorov and algorithmic complexity
Reference
Chaitin, G.J., Exploring Randomness, London, Springer-Verlag, 2001. Google
17 ;;Quote: maybe pure mathematics is random; e.g., distribution of the primes; there's nothing there to prove
20 ;;Quote: the halting probability is a well-defined real number with no mathematical structure; the bits are random
46 ;;Quote: with densely packed information, a random change to a meaningful message is meaningful
111 ;;Quote: something is random iff it is incompressible
Topic: randomness (20 items)
Topic: chaotic behavior (27 items)
Group: philosophy of mathematics (11 topics, 330 quotes)
Topic: Turing machine (30 items)
Group: information (46 topics, 1160 quotes)
Topic: Kolmorgorov and algorithmic complexity (10 items)