Algorithmic randomness complexity de rodney downey (25 resultados)
- Tapa dura
Librería: Universitätsbuchhandlung Herta Hold GmbH, Berlin, AlemaniaUniversitätsbuchhandlung Herta Hold GmbH
Contactar con el vendedorVendedor de 4 estrellasCondición: Usado
EUR 20,00
Envío por EUR 30,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
2010th ed. 16 x 23 cm. 883 pages. Hardcover. Sprache: Englisch.
- Tapa blanda
Librería: Antiquariat Bernhardt, Kassel, AlemaniaAntiquariat Bernhardt
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Excelente
EUR 74,90
Envío por EUR 49,90Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Karton Karton. Condición: Sehr gut. 855 Seiten, Zust: Gutes Exemplar. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post…. Sprache: Englisch Gewicht in Gramm: 1460.
- Tapa blanda
Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 116,34
Envío por EUR 13,97Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. In.
- Tapa dura
Librería: Wonder Book, Frederick, MD, Estados Unidos de AmericaWonder Book
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Como Nuevo
EUR 132,84
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: As New. Like New condition. A near perfect copy that may have very minor cosmetic defects. NOT AVAILABLE FOR SHIPMENT OUTSIDE OF THE UNITED STATES.
- Tapa blanda
Librería: Chiron Media, Wallingford, Reino UnidoChiron Media
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 114,37
Envío por EUR 18,06Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 10 disponibles
PF. Condición: New.
- Tapa dura
Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 153,23
Envío por EUR 13,97Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. In.
- Tapa dura
Librería: California Books, Miami, FL, Estados Unidos de AmericaCalifornia Books
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 177,73
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New.
Más imágenes- Tapa blanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 104,25
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Taschenbuch. Condición: Neu. Algorithmic Randomness and Complexity | Rodney G. Downey (u. a.) | Taschenbuch | xxviii | Englisch | 2016 | Springer | EAN 9781493938209 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
- Tapa blanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 124,04
Envío por EUR 66,56Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: 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.
- Tapa dura
Librería: Rarewaves.com USA, London, LONDO, Reino UnidoRarewaves.com USA
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 205,68
Gastos de envío gratisSe envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Hardback. Condición: New. 2010th. 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 number…s and other continuous structures, especially incorporating concepts of "randomness." This book provides a systematic, technical development of "algorithmic randomness" and complexity. It presents concepts and results for understanding relative randomness and its relation to computational complexity. These new results are important for addressing fundamental problems in computational geometry, modeling of dynamic systems, and classical problems in numerical computations.
- Tapa dura
Librería: BennettBooksLtd, Los Angeles, CA, Estados Unidos de AmericaBennettBooksLtd
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 200,19
Envío por EUR 6,00Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
hardcover. Condición: New. In shrink wrap. Looks like an interesting title.
- Tapa dura
Librería: Books Puddle, New York, NY, Estados Unidos de AmericaBooks Puddle
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 222,59
Envío por EUR 3,44Se envía dentro de Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. pp. 884.
- Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 160,49
Envío por EUR 66,75Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Buch. Condición: 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.
- Tapa dura
Librería: Mispah books, Redhill, SURRE, Reino UnidoMispah books
Contactar con el vendedorVendedor de 4 estrellasCondición: Usado - Como Nuevo
EUR 240,17
Envío por EUR 29,15Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Tapa dura
Librería: Rarewaves.com UK, London, Reino UnidoRarewaves.com UK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 201,20
Envío por EUR 75,78Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Hardback. Condición: New. 2010th. 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 number…s and other continuous structures, especially incorporating concepts of "randomness." This book provides a systematic, technical development of "algorithmic randomness" and complexity. It presents concepts and results for understanding relative randomness and its relation to computational complexity. These new results are important for addressing fundamental problems in computational geometry, modeling of dynamic systems, and classical problems in numerical computations.
- Tapa dura
Librería: BUCHSERVICE / ANTIQUARIAT Lars Lutzer, Wahlstedt, AlemaniaBUCHSERVICE / ANTIQUARIAT Lars Lutzer
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Bueno
EUR 349,90
Envío por EUR 39,95Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: gut. 2010. Algorithmic Randomness and Complexity (Theory and Applications of Computability) In englischer Sprache. pages.
- Tapa blanda
- Impresión bajo demanda
Librería: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 94,25
Envío por EUR 11,00Se envía de Italia a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: new. Questo è un articolo print on demand.
- Tapa blanda
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 117,69
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - 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 Wh…at 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. 884 pp. Englisch.
- Tapa blanda
- Impresión bajo demanda
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 98,54
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: 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 comp…uter scie.
- Tapa dura
- Impresión bajo demanda
Librería: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 126,26
Envío por EUR 24,20Se envía de Italia a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: new. Questo è un articolo print on demand.
- Tapa blanda
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 117,69
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 com…putability theory and complexity theory over the real numbers and other continuous structures, especially incorporating concepts of 'randomness.' This book provides a systematic, technical development of 'algorithmic randomness' and complexity. It presents concepts and results for understanding relative randomness and its relation to computational complexity. These new results are important for addressing fundamental problems in computational geometry, modeling of dynamic systems, and classical problems in numerical computations.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 884 pp. Englisch.
- Tapa dura
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 160,49
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - 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. 855 pp. Englisch.
- Tapa dura
- Impresión bajo demanda
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 137,26
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: 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 comp…uter scie.
- Tapa dura
- Impresión bajo demanda
Librería: Majestic Books, Hounslow, Reino UnidoMajestic Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 229,58
Envío por EUR 7,58Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. Print on Demand pp. 884 Illus.
- Tapa dura
- Impresión bajo demanda
Librería: Biblios, frankfurt am main, HESSE, AlemaniaBiblios
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 236,40
Envío por EUR 9,95Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. PRINT ON DEMAND pp. 884.
