Garantía de entrega
Artículo: AMZ-1493938207
Algorithmic Randomness and Complexity (Theory and Applications of Computability)
Format:
Paperback
Detalles del producto
Disponibilidad
En stock
En stock
Peso con empaque
1.29 kg
1.29 kg
Devolución
No
No
Condición
Nuevo
Nuevo
Producto de
Amazon
Amazon
Viaja desde
USA
USA
Sobre este producto
- 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 as a real number is random, or to say that one real is more random than another? And what is the relationship between randomness and computational power. The theory of algorithmic randomness uses tools from computability theory and algorithmic information theory to address questions such as these. Much of this theory can be seen as exploring the relationships between three fundamental concepts: relative computability, as measured by notions such as Turing reducibility; information content, as measured by notions such as Kolmogorov complexity; and randomness of individual objects, as first successfully defined by Martin-Löf. Although algorithmic randomness has been studied for several decades, a dramatic upsurge of interest in the area, starting in the late 1990s, has led to significant advances. This is the first comprehensive treatment of this important field, designed to be both a reference tool for experts and a guide for newcomers. It surveys a broad section of work in the area, and presents most of its major results and techniques in depth. Its organization is designed to guide the reader through this large body of work, providing context for its many concepts and theorems, discussing their significance, and highlighting their interactions. It includes a discussion of effective dimension, which allows us to assign concepts like Hausdorff dimension to individual reals, and a focused but detailed introduction to computability theory. It will be of interest to researchers and students in computability theory, algorithmic information theory, and theoretical computer science.
$249,75
49% OFF
$128,08
IMPORT EASILY
By purchasing this product you can deduct VAT with your RUT number
$249,75
49% OFF
$128,08
3 meses de gracia en diferidos y hasta 6 meses sin intereses con Pacificard
Envío gratis
Llega en 16 a 26 días hábiles
Con envío
Tienes garantia de entrega
Este producto viaja
de USA ![]()
a tus manos en
![]()
a tus manos en
Compra protegida
Disfruta de una experiencia de compra segura y confiable
![]()
Garantía de entrega
Con Tiendamia todas tus compras cuentan con Garantía de Entrega o devolución total de tu dinero.
Compras 100% seguras y garantizadas, para que pidas lo que sueñas y lo recibas del mundo a tu puerta.
Tarjetas de Débito y Crédito
Visa
Mastercard
American Express
Dinners
Discover
Alias
Pagos a través de PayPal
Compra procesada en dólares con dinero en cuenta o tarjetas internacionales.
PayPal
.svg)
