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 s...
Clasificación: | Libro Electrónico |
---|---|
Autores principales: | Downey, Rodney G. (Autor), Hirschfeldt, Denis R. (Autor) |
Autor Corporativo: | SpringerLink (Online service) |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
New York, NY :
Springer New York : Imprint: Springer,
2010.
|
Edición: | 1st ed. 2010. |
Colección: | Theory and Applications of Computability, In cooperation with the association Computability in Europe,
|
Temas: | |
Acceso en línea: | Texto Completo |
Ejemplares similares
-
Randomized algorithms /
por: Motwani, Rajeev
Publicado: (1995) -
Design and Analysis of Randomized Algorithms Introduction to Design Paradigms /
por: Hromkovic, J.
Publicado: (2005) -
Concentration of Measure for the Analysis of Randomized Algorithms.
por: Dubhashi, Devdatt
Publicado: (2009) -
Concentration of measure for the analysis of randomized algorithms /
por: Dubhashi, Devdatt
Publicado: (2009) -
Algorithms and Complexity 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings /
Publicado: (2006)