You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
| Chapter title |
The connection between program-size complexity and algorithmic probability: H(x) =-log 2 P(x) + O (1). Occam’s razor: there are few minimum-size programs
|
|---|---|
| Chapter number | 6 |
| Book title |
Exploring RANDOMNESS
|
| Published by |
Springer, London, January 2001
|
| DOI | 10.1007/978-1-4471-0307-3_6 |
| Book ISBNs |
978-1-4471-1085-9, 978-1-4471-0307-3
|
| Authors |
Gregory J. Chaitin, Chaitin, Gregory J. |