Items related to Algorithmic Randomness and Complexity

Algorithmic Randomness and Complexity - Softcover

Downey, Rodney G.; Hirschfeldt, Denis R.

 
9780387571850: Algorithmic Randomness and Complexity
Softcover
ISBN 10: 038757185X ISBN 13: 9780387571850
Publisher: Springer, 2010

This specific ISBN edition is currently not available.

Synopsis

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.

"synopsis" may belong to another edition of this title.

  • PublisherSpringer
  • Publication date2010
  • ISBN 10 038757185X
  • ISBN 13 9780387571850
  • BindingPaperback
  • LanguageEnglish
  • Number of pages884

(No Available Copies)

Search Books:



Create a Want

Can't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!

Create a Want

Other Popular Editions of the Same Title

9780387955674: Algorithmic Randomness and Complexity: 0 (Theory and Applications of Computability)

Featured Edition

ISBN 10:  0387955674 ISBN 13:  9780387955674
Publisher: Springer, 2010
Hardcover