Order Total (1 Item Items):
Shipping Destination:
Algorithmic Randomness Complexity by Downey Rodney (18 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (18)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (14)
- As New, Fine or Near Fine (3)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (1)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (8)
- Not Print on Demand (12)
Language (1)
Free Shipping
- Free Shipping to U.S.A. (No further results match this refinement)
Seller Location
Seller Rating
-
Algorithmic Randomness and Complexity (Theory and Applications of Computability).
Seller: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Germany
Association Member: GIAQ ILAB VDA
Seller rating 5 out of 5 stars
2010th ed. 16 x 23 cm. 883 pages. Hardcover. Sprache: Englisch.
-
Algorithmic Randomness and Complexity (Theory and Applications of Computability)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 126.54
US$ 15.64 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
PF. Condition: New.
-
Karton. Condition: Sehr gut. Zust: Gutes Exemplar. 855 Seiten, Englisch 1460g.
-
Algorithmic Randomness and Complexity (Theory and Applications of Computability).
Published by New York, Springer., 2010
Language: English
Seller: Antiquariat Thomas Haker GmbH & Co. KG, Berlin, Germany
Association Member: GIAQ
Seller rating 5 out of 5 stars
Hardcover. Condition: Sehr gut. 855 p., with figures, Very good condition. Sprache: Englisch Gewicht in Gramm: 1590.
-
-
Algorithmic Randomness and Complexity (Theory and Applications of Computability)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 166.87
US$ 15.64 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Taschenbuch. Condition: 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.
-
Condition: New. pp. 884.
-
hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
-
Buch. Condition: 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.
-
Hardcover. Condition: Like New. Like New. book.
-
Condition: 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.
-
Algorithmic Randomness and Complexity
Published by SPRINGER NATURE Nov 2010, 2010
ISBN 10: 0387955674 ISBN 13: 9780387955674
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: 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.
-
Gebunden. Condition: 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.
-
Condition: New. Print on Demand pp. 884 Illus.
-
Buch. Condition: 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.
-
Condition: New. PRINT ON DEMAND pp. 884.
