Order Total (1 Item Items):
Shipping Destination:
Algorithmic Randomness Complexity by Downey Rodney (20 results)
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 Learn more
- New (16)
- 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 (9)
- Not Print on Demand (15)
Language (1)
Free Shipping
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).
Language: English
Published by New York, Springer., 2010
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$ 132.32
US$ 16.32 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
US$ 133.64
US$ 21.10 shipping
Ships from United Kingdom to U.S.A.Quantity: 10 available
Add to basketPF. Condition: New.
-
Karton. Condition: Sehr gut. Zust: Gutes Exemplar. 855 Seiten, Englisch 1460g.
-
-
Algorithmic Randomness and Complexity (Theory and Applications of Computability)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 174.42
US$ 16.32 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
-
Condition: New. pp. 884.
-
hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
-
Algorithmic Randomness and Complexity
Language: English
Published by Springer-Verlag New York Inc., US, 2010
ISBN 10: 0387955674 ISBN 13: 9780387955674
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
US$ 234.73
Free Shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: New. 2010th. This book is concerned with the theory of computability and complexity over the real numbers. This theory was initiated by Turing, Grzegorczyk, Lacombe, Banach, and Mazur and has seen rapid growth in recent years. Computability and complexity theory are two central areas of research in theoretical computer science. Until recently, most work in these areas concentrated on problems over discrete structures, but there has been enormous growth of computability theory and complexity theory over the real numbers and other continuous structures, especially incorporating concepts of "randomness". One reason for this growth is that more and more computation problems over the real numbers are being dealt with by computer scientists - in computational geometry and in the modeling of dynamical and hybrid systems. Scientists working on these questions come from such diverse fields as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics, and analysis. An essential resource for all researchers in theoretical computer science, logic, computability theory and complexity.
-
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.
-
US$ 255.38
US$ 34.06 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Algorithmic Randomness and Complexity
Language: English
Published by Springer-Verlag New York Inc., US, 2010
ISBN 10: 0387955674 ISBN 13: 9780387955674
US$ 226.69
US$ 88.55 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: New. 2010th. This book is concerned with the theory of computability and complexity over the real numbers. This theory was initiated by Turing, Grzegorczyk, Lacombe, Banach, and Mazur and has seen rapid growth in recent years. Computability and complexity theory are two central areas of research in theoretical computer science. Until recently, most work in these areas concentrated on problems over discrete structures, but there has been enormous growth of computability theory and complexity theory over the real numbers and other continuous structures, especially incorporating concepts of "randomness". One reason for this growth is that more and more computation problems over the real numbers are being dealt with by computer scientists - in computational geometry and in the modeling of dynamical and hybrid systems. Scientists working on these questions come from such diverse fields as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics, and analysis. An essential resource for all researchers in theoretical computer science, logic, computability theory and complexity.
-
US$ 110.07
US$ 58.18 shipping
Ships 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.
-
Algorithmic Randomness and Complexity
Language: English
Published by SPRINGER NATURE Nov 2010, 2010
ISBN 10: 0387955674 ISBN 13: 9780387955674
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.
-
US$ 157.06
US$ 58.18 shipping
Ships 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$ 212.68
US$ 8.86 shipping
Ships from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. Print on Demand pp. 884 Illus.
-
Condition: New. PRINT ON DEMAND pp. 884.
