menu
{ "item_title" : "Algorithmic Randomness", "item_author" : [" Johanna N. Y. Franklin", "Christopher P. Porter "], "item_description" : "The last two decades have seen a wave of exciting new developments in the theory of algorithmic randomness and its applications to other areas of mathematics. This volume surveys much of the recent work that has not been included in published volumes until now. It contains a range of articles on algorithmic randomness and its interactions with closely related topics such as computability theory and computational complexity, as well as wider applications in areas of mathematics including analysis, probability, and ergodic theory. In addition to being an indispensable reference for researchers in algorithmic randomness, the unified view of the theory presented here makes this an excellent entry point for graduate students and other newcomers to the field.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/1/10/847/898/1108478980_b.jpg", "price_data" : { "retail_price" : "179.00", "online_price" : "179.00", "our_price" : "179.00", "club_price" : "179.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Algorithmic Randomness|Johanna N. Y. Franklin

Algorithmic Randomness : Progress and Prospects

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

The last two decades have seen a wave of exciting new developments in the theory of algorithmic randomness and its applications to other areas of mathematics. This volume surveys much of the recent work that has not been included in published volumes until now. It contains a range of articles on algorithmic randomness and its interactions with closely related topics such as computability theory and computational complexity, as well as wider applications in areas of mathematics including analysis, probability, and ergodic theory. In addition to being an indispensable reference for researchers in algorithmic randomness, the unified view of the theory presented here makes this an excellent entry point for graduate students and other newcomers to the field.

This item is Non-Returnable

Details

  • ISBN-13: 9781108478984
  • ISBN-10: 1108478980
  • Publisher: Cambridge University Press
  • Publish Date: May 2020
  • Dimensions: 9.1 x 6.27 x 0.99 inches
  • Shipping Weight: 1.4 pounds
  • Page Count: 368

Related Categories

You May Also Like...

    1

BAM Customer Reviews