Algorithmic Randomness and Complexity

€209.00
+ €9.99 Shipping

Algorithmic Randomness and Complexity

  • Brand: Unbranded
  • product image
Algorithmic Randomness and Complexity

Algorithmic Randomness and Complexity

  • Brand: Unbranded
Price: €209.00
Sold by:
€209.00
+ €9.99 Shipping

In stock

We accept the following payment methods

Description

Background. - Preliminaries. - Computability Theory. - Kolmogorov Complexity of Finite Strings. - Relating Complexities. - Effective Reals. - Notions of Randomness. - Martin-Löf Randomness. - Other Notions of Algorithmic Randomness. - Algorithmic Randomness and Turing Reducibility. - Relative Randomness. - Measures of Relative Randomness. - Complexity and Relative Randomness for 1-Random Sets. - Randomness-Theoretic Weakness. - Lowness and Triviality for Other Randomness Notions. - Algorithmic Dimension. - Further Topics. - Strong Jump Traceability. - ? as an Operator. - Complexity of Computably Enumerable Sets. Language: English
  • Brand: Unbranded
  • Category: Computing & Internet
  • Artist: Rodney G. Downey
  • Format: Hardback
  • Language: English
  • Publication Date: 2010/11/05
  • Publisher / Label: Springer
  • Number of Pages: 855
  • Fruugo ID: 337966590-741626596
  • ISBN: 9780387955674

Delivery & Returns

Dispatched within 4 days

  • STANDARD: €9.99 - Delivery between Tue 07 October 2025–Fri 10 October 2025

Shipping from United Kingdom.

We do our best to ensure that the products that you order are delivered to you in full and according to your specifications. However, should you receive an incomplete order, or items different from the ones you ordered, or there is some other reason why you are not satisfied with the order, you may return the order, or any products included in the order, and receive a full refund for the items. View full return policy