Da: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Germania
EUR 20,00
Quantità: 2 disponibili
Aggiungi al carrello2010th ed. 16 x 23 cm. 883 pages. Hardcover. Sprache: Englisch.
Da: Best Price, Torrance, CA, U.S.A.
Condizione: New. SUPER FAST SHIPPING.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 110,05
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
EUR 111,36
Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
Da: Antiquariat Bernhardt, Kassel, Germania
EUR 102,48
Quantità: 1 disponibili
Aggiungi al carrelloKarton. Condizione: Sehr gut. Zust: Gutes Exemplar. 855 Seiten, Englisch 1460g.
Editore: New York, Springer., 2010
Lingua: Inglese
Da: Antiquariat Thomas Haker GmbH & Co. KG, Berlin, Germania
Membro dell'associazione: GIAQ
EUR 35,44
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Sehr gut. 855 p., with figures, Very good condition. Sprache: Englisch Gewicht in Gramm: 1590.
Da: Best Price, Torrance, CA, U.S.A.
Condizione: New. SUPER FAST SHIPPING.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 150,77
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 145,13
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
EUR 93,45
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Algorithmic Randomness and Complexity | Rodney G. Downey (u. a.) | Taschenbuch | xxviii | Englisch | 2016 | Humana | EAN 9781493938209 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Condizione: New. pp. 884.
Da: BennettBooksLtd, San Diego, NV, U.S.A.
hardcover. Condizione: New. In shrink wrap. Looks like an interesting title!
EUR 157,79
Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Intuitively, a sequence such as 101010101010101010. does not seem random, whereas 101101011101010100., obtained using coin tosses, does. How can we reconcile this intuition with the fact that both are statistically equally likely What does it mean to say that an individual mathematical object such as a real number is random, or to say that one real is more random than another And what is the relationship between randomness and computational power. The theory of algorithmic randomness uses tools from computability theory and algorithmic information theory to address questions such as these. Much of this theory can be seen as exploring the relationships between three fundamental concepts: relative computability, as measured by notions such as Turing reducibility; information content, as measured by notions such as Kolmogorov complexity; and randomness of individual objects, as first successfully defined by Martin-Löf. Although algorithmic randomness has been studied for several decades, a dramatic upsurge of interest in the area, starting in the late 1990s, has led to significant advances. This is the first comprehensive treatment of this important field, designed to be both a reference tool for experts and a guide for newcomers. It surveys a broad section of work in the area, and presents most of its major results and techniques in depth. Its organization is designed to guide the reader through this large body of work, providing context for its many concepts and theorems, discussing their significance, and highlighting their interactions. It includes a discussion of effective dimension, which allows us to assign concepts like Hausdorff dimension to individual reals, and a focused but detailed introduction to computability theory. It will be of interest to researchers and students in computability theory, algorithmic information theory, and theoretical computer science.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 233,84
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. Like New. book.
Da: moluna, Greven, Germania
EUR 89,99
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Authors were awarded the 2016 Shoenfield Prize by the Association for Symbolic Logic for outstanding expository writing in the field of logicEssential resource for researchers and graduate students in theoretical computer scie.
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 149,79
Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 855 pp. Englisch.
Da: moluna, Greven, Germania
EUR 128,41
Quantità: Più di 20 disponibili
Aggiungi al carrelloGebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Authors were awarded the 2016 Shoenfield Prize by the Association for Symbolic Logic for outstanding expository writing in the field of logicEssential resource for researchers and graduate students in theoretical computer scie.
Da: Majestic Books, Hounslow, Regno Unito
EUR 202,64
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 884 Illus.
Da: preigu, Osnabrück, Germania
EUR 137,05
Quantità: 5 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Algorithmic Randomness and Complexity | Rodney G Downey (u. a.) | Buch | xxviii | Englisch | 2010 | Springer New York | EAN 9780387955674 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 201,57
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 884.