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...
Κύριοι συγγραφείς: | Downey, Rodney G. (Συγγραφέας), Hirschfeldt, Denis R. (Συγγραφέας) |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
New York, NY :
Springer New York,
2010.
|
Έκδοση: | 1. |
Σειρά: | Theory and Applications of Computability, In cooperation with the association Computability in Europe,
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Algorithmic Randomness and Complexity
ανά: Downey, Rodney G
Έκδοση: (2010) -
Design and Analysis of Randomized Algorithms Introduction to Design Paradigms /
ανά: HromkoviČ, Juraj
Έκδοση: (2005) -
Frontiers in Algorithmics 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings /
Έκδοση: (2015) -
Parameterized Complexity Theory
ανά: Flum, Jörg, κ.ά.
Έκδοση: (2006) -
Algorithms and Complexity 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006. Proceedings /
Έκδοση: (2006)