Algorithmic Randomness and Complexity
Intuitively, a sequence such as 101010101010101010& does not seem random, whereas 101101011101010100&, obtained using coin tosses, does. How can we reconcile this intuition with the fact that both are statistically equally likely? What does it mean to say that an individual mathematical obje...
| Main Authors: | , |
|---|---|
| Corporate Author: | |
| Format: | Electronic |
| Language: | English |
| Published: |
New York, NY :
Springer New York,
2010.
|
| Edition: | 1. |
| Series: | Theory and Applications of Computability, In cooperation with the association Computability in Europe,
|
| Subjects: | |
| Online Access: | https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-0-387-68441-3 |