E-Book, Englisch, 883 Seiten, eBook
Reihe: Mathematics and Statistics
Downey / Hirschfeldt Algorithmic Randomness and Complexity
2010
ISBN: 978-0-387-68441-3
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark
E-Book, Englisch, 883 Seiten, eBook
Reihe: Mathematics and Statistics
ISBN: 978-0-387-68441-3
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark
Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of "algorithmic randomness" and complexity for scientists from diverse fields.
Zielgruppe
Graduate
Autoren/Hrsg.
Weitere Infos & Material
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.




