Pub. Date:
Springer New York
Algorithmic Randomness and Complexity / Edition 1

Algorithmic Randomness and Complexity / Edition 1


Current price is , Original price is $109.99. You

Temporarily Out of Stock Online

Please check back later for updated availability.

Product Details

ISBN-13: 9780387955674
Publisher: Springer New York
Publication date: 11/05/2010
Series: Theory and Applications of Computability
Edition description: 2010
Pages: 855
Product dimensions: 6.40(w) x 9.40(h) x 2.20(d)

Table of Contents

Preface.- Acknowledgments.- Introduction.- I. Background.- Preliminaries.- Computability Theory.- Kolmogorov Complexity of Finite Strings.- Relating Plain and Prefix-Free Complexity.- Effective Reals.- II. Randomness of Sets.- Martin-Löf Randomness.- Other Notions of Effective Randomness.- Algorithmic Randomness and Turing Reducibility.- III. Relative Randomness.- Measures of Relative Randomness.- The Quantity of K- and Other Degrees.- Randomness-Theoretic Weakness.- Lowness for Other Randomness Notions.- Effective Hausdorff Dimension.- IV. Further Topics.- Omega as an Operator.- Complexity of C.E. Sets.- References.- Index.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews