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 object such...
| Main Authors: | Downey, Rodney G. (Author), Hirschfeldt, Denis R. (Author) |
|---|---|
| Corporate Author: | SpringerLink (Online service) |
| Format: | Electronic eBook |
| 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: | Full Text via HEAL-Link |
Similar Items
-
Algorithmic Randomness and Complexity
by: Downey, Rodney G
Published: (2010) -
Design and Analysis of Randomized Algorithms Introduction to Design Paradigms /
by: HromkoviČ, Juraj
Published: (2005) -
Frontiers in Algorithmics 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings /
Published: (2015) -
Parameterized Complexity Theory
by: Flum, Jörg, et al.
Published: (2006) -
Algorithms and Complexity 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006. Proceedings /
Published: (2006)