9780387955674 - algorithmic randomness and complexity di downey, rod; hirschfeldt, denis (15 risultati)
- Rilegato
Da: Universitätsbuchhandlung Herta Hold GmbH, Berlin, , GermaniaUniversitätsbuchhandlung Herta Hold GmbH
Contatta il venditoreVenditore con 4 stelleCondizione: Usato
EUR 20,00
EUR 30,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
2010th ed. 16 x 23 cm. 883 pages. Hardcover. Sprache: Englisch.
- Rilegato
Da: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.ThriftBooks-Atlanta
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Molto buono
EUR 113,88
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: Very Good. No Jacket. Former library book; May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
- Rilegato
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 152,31
EUR 13,88 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Brossura
Da: Antiquariat Bernhardt, Kassel, GermaniaAntiquariat Bernhardt
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Ottimo
EUR 120,25
EUR 49,90 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Karton Karton. Condizione: 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 Pos…t. Sprache: Englisch Gewicht in Gramm: 1460.
- Rilegato
Da: Rarewaves.com USA, London, LONDO, Regno UnitoRarewaves.com USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 203,64
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Hardback. Condizione: 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 theoreti…cal 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.
- Rilegato
Da: BennettBooksLtd, Los Angeles, CA, U.S.A.BennettBooksLtd
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 200,41
EUR 6,00 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
hardcover. Condizione: New. In shrink wrap. Looks like an interesting title.
- Rilegato
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 220,93
EUR 3,45 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New. pp. 884.
- Rilegato
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 170,64
EUR 66,75 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Buch. Condizione: 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.
- Rilegato
Da: Mispah books, Redhill, SURRE, Regno UnitoMispah books
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Come nuovo
EUR 217,25
EUR 28,97 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Rilegato
Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 192,84
EUR 75,33 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Hardback. Condizione: 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 theoreti…cal 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.
- Rilegato
- Print on Demand
Da: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contatta il venditoreVenditore con 3 stelleCondizione: Nuovo
EUR 126,26
EUR 24,20 spedizioneSpedito da Italia a U.S.A.Quantità: Più di 20 disponibili
Condizione: new. Questo è un articolo print on demand.
- Rilegato
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 160,49
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Buch. Condizione: 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 doe…s 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.
- Rilegato
- Print on Demand
Da: moluna, Greven, , Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 137,26
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: 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 com…puter scie.
- Rilegato
- Print on Demand
Da: Majestic Books, Hounslow, , Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 228,87
EUR 7,53 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: New. Print on Demand pp. 884 Illus.
- Rilegato
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 230,68
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND pp. 884.
