Order Total (1 Item Items):
Shipping Destination:
Algorithmic Randomness Complexity by Denis Hirschfeldt (20 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (20)
- 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
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 (9)
- Not Print on Demand (15)
Language (1)
Price
- Any Price
- Under US$ 25 (No further results match this refinement)
- US$ 25 to US$ 50 (No further results match this refinement)
- Over US$ 50
Free Shipping
Seller Location
Seller Rating
-
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
US$ 56.21
Convert currencyUS$ 28.42 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Sehr gut. 855 p., with figures, Very good condition. Sprache: Englisch Gewicht in Gramm: 1590.
-
Condition: New.
-
Algorithmic Randomness and Complexity (Theory and Applications of Computability)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 136.16
Convert currencyUS$ 16.22 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Algorithmic Randomness and Complexity
Published by Springer New York, Springer US, 2016
ISBN 10: 1493938207 ISBN 13: 9781493938209
Language: English
US$ 132.83
Convert currencyUS$ 39.28 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketTaschenbuch. 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.
-
US$ 170.95
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
US$ 169.61
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Algorithmic Randomness and Complexity (Theory and Applications of Computability)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 179.67
Convert currencyUS$ 16.22 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Condition: New.
-
Algorithmic Randomness And Complexity
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 179.66
Convert currencyUS$ 20.31 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
US$ 182.75
Convert currencyUS$ 33.85 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: Like New. Like New. book.
-
hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
-
Condition: New. pp. 884.
-
Algorithmic Randomness And Complexity
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 263.60
Convert currencyUS$ 20.31 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
US$ 252.46
Convert currencyUS$ 33.85 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Like New. Like New. book.
-
US$ 283.66
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Algorithmic Randomness and Complexity
Published by Springer New York Aug 2016, 2016
ISBN 10: 1493938207 ISBN 13: 9781493938209
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
US$ 125.28
Convert currencyUS$ 26.15 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketTaschenbuch. 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. 884 pp. Englisch.
-
US$ 108.90
Convert currencyUS$ 55.69 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: 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.
-
US$ 150.36
Convert currencyUS$ 55.69 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketGebunden. 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.
-
US$ 236.14
Convert currencyUS$ 8.80 shipping from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. Print on Demand pp. 884 Illus.
-
US$ 256.39
Convert currencyUS$ 11.31 shipping from Germany to U.S.A.Quantity: 4 available
Add to basketCondition: New. PRINT ON DEMAND pp. 884.
