Algorithmic Randomness and Complexity (eBook, PDF) - Hirschfeldt, Denis R.; Downey, Rodney G.
-28%
68,95 €
Statt 95,99 €**
68,95 €
inkl. MwSt.
**Preis der gedruckten Ausgabe (Gebundenes Buch)
Sofort per Download lieferbar
Versandkostenfrei*
34 °P sammeln
-28%
68,95 €
Statt 95,99 €**
68,95 €
inkl. MwSt.
**Preis der gedruckten Ausgabe (Gebundenes Buch)
Sofort per Download lieferbar
Versandkostenfrei*

Alle Infos zum eBook verschenken
34 °P sammeln
Als Download kaufen
Statt 95,99 €**
-28%
68,95 €
inkl. MwSt.
**Preis der gedruckten Ausgabe (Gebundenes Buch)
Sofort per Download lieferbar
34 °P sammeln
Jetzt verschenken
Statt 95,99 €**
-28%
68,95 €
inkl. MwSt.
**Preis der gedruckten Ausgabe (Gebundenes Buch)
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
34 °P sammeln
  • Format: PDF


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.

Produktbeschreibung
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.


Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

  • Produktdetails
  • Verlag: Springer-Verlag GmbH
  • Erscheinungstermin: 29.10.2010
  • Englisch
  • ISBN-13: 9780387684413
  • Artikelnr.: 43732742
Inhaltsangabe
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.
Rezensionen
From the reviews:

"Develops the prerequisites to algorithmic randomness: computability theory and Kolmogorov complexity. ... Studying these ... one should be able to proceed in the area with confidence. A draft of the book under review has been circulating for years and the reviewer found it to be the best source when attempting to conduct research in the area ... . It is advantageous for the future of the area of algorithmic randomness that these two books were published at the cusp of a period of great activity." (Bjørn Kjos-Hanssen, Mathematical Reviews, Issue 2012 g)

"A thorough and systematic study of algorithmic randomness, this long-awaited work is an irreplaceable source of well-presented classic and new results for advanced undergraduate and graduate students, as well as researchers in the field and related areas. The book joins a select number of books in this category." (Hector Zenil, ACM Computing Reviews, October, 2011)