denis r hirschfeldt (19 Ergebnisse)

Softcover. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. C-00866 9781470426576 Sprache: Englisch Gewicht in Gramm: 150.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

2010th ed. 16 x 23 cm. 883 pages. Hardcover. Sprache: Englisch.

Zustand: Used. pp. 232.

Zustand: Used. pp. 232.

Zustand: New. In.

Hardcover. Zustand: Brand New. 225 pages. 9.25x6.50x1.00 inches. In Stock.

Karton. Zustand: Sehr gut. Zust: Gutes Exemplar. 855 Seiten, Englisch 1460g.

Zustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.

Zustand: New. In.

Zustand: New. In.

Hardcover. Zustand: Sehr gut. 855 p., with figures, Very good condition. Sprache: Englisch Gewicht in Gramm: 1590.

Zustand: New. In.

Taschenbuch. Zustand: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 884 pp. Englisch.

Buch. Zustand: Neu. Neuware -The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra.Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of computation, probability theory applied to algorithmics (randomized alogrithms), parametric complexity, Kolmogorov complexity of finite strings, computational group theory, counting problems, and canonical models of ZFC providing a solution to continuum hypothesis.The text addresses students in computer science or mathematics, and professionals in these areas who seek a complete, but gentle introduction to a wide range of techniques, concepts, and research horizons in the area of computational complexity in a broad sense.Walter de Gruyter GmbH, Genthiner Strasse 13, 10785 Berlin 180 pp. Englisch.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra. Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of computation, probability theory applied to algorithmics (randomized alogrithms), parametric complexity, Kolmogorov complexity of finite strings, computational group theory, counting problems, and canonical models of ZFC providing a solution to continuum hypothesis. The text addresses students in computer science or mathematics, and professionals in these areas who seek a complete, but gentle introduction to a wide range of techniques, concepts, and research horizons in the area of computational complexity in a broad sense.

Taschenbuch. Zustand: 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. Zustand: Brand New. illustrated edition. 288 pages. 9.25x6.75x0.50 inches. In Stock.

Zustand: New. 2001. Hardcover. . . . . . Books ship from the US and Ireland.