Algorithmic Randomness and Complexity (Theory and Applications of Computability)

309.47 SGD
Member Price
278.53
English

Product Description

The theory of algorithmic randomness uses tools from computability theory and algorithmic information theory to address questions such as these. It will be of interest to researchers and students in computability theory, algorithmic information theory, and theoretical computer science.

Available to Order

Usually dispatches within 3-4 weeks

While every attempt has been made to ensure stock availability, occasionally we may run out of stock at our stores.

Free domestic shipping on orders over 50.00SGD

Discount is applied at checkout.

Recently Viewed Items

Related Products