Atnaujinkite slapukų nuostatas

El. knyga: Algorithmic Randomness: Progress and Prospects

Edited by (Drake University, Iowa), Edited by (Hofstra University, New York)
  • Formatas: PDF+DRM
  • Serija: Lecture Notes in Logic
  • Išleidimo metai: 07-May-2020
  • Leidėjas: Cambridge University Press
  • Kalba: eng
  • ISBN-13: 9781108808279
Kitos knygos pagal šią temą:
Algorithmic Randomness: Progress and ProspectsDidesnis paveikslėlis
  • Formatas: PDF+DRM
  • Serija: Lecture Notes in Logic
  • Išleidimo metai: 07-May-2020
  • Leidėjas: Cambridge University Press
  • Kalba: eng
  • ISBN-13: 9781108808279
Kitos knygos pagal šią temą:

DRM apribojimai

  • Kopijuoti:

    neleidžiama

  • Spausdinti:

    neleidžiama

  • El. knygos naudojimas:

    Skaitmeninių teisių valdymas (DRM)
    Leidykla pateikė šią knygą šifruota forma, o tai reiškia, kad norint ją atrakinti ir perskaityti reikia įdiegti nemokamą programinę įrangą. Norint skaityti šią el. knygą, turite susikurti Adobe ID . Daugiau informacijos  čia. El. knygą galima atsisiųsti į 6 įrenginius (vienas vartotojas su tuo pačiu Adobe ID).

    Reikalinga programinė įranga
    Norint skaityti šią el. knygą mobiliajame įrenginyje (telefone ar planšetiniame kompiuteryje), turite įdiegti šią nemokamą programėlę: PocketBook Reader (iOS / Android)

    Norint skaityti šią el. knygą asmeniniame arba „Mac“ kompiuteryje, Jums reikalinga  Adobe Digital Editions “ (tai nemokama programa, specialiai sukurta el. knygoms. Tai nėra tas pats, kas „Adobe Reader“, kurią tikriausiai jau turite savo kompiuteryje.)

    Negalite skaityti šios el. knygos naudodami „Amazon Kindle“.

"The last two decades have seen a wave of exciting new developments in the theory of algorithmic randomness and its applications to other areas of mathematics. This volume surveys much of the recent work that has not been included in published volumes until now. It contains a range of articles on algorithmic randomness and its interactions with closely related topics such as computability theory and computational complexity, as well as wider applications in areas of mathematics including analysis, probability, and ergodic theory. In addition to being an indispensable reference for researchers in algorithmic randomness, the unified view of the theory presented here makes this an excellent entry point for graduate students and other newcomers to the field"--

Daugiau informacijos

Surveys on recent developments in the theory of algorithmic randomness and its interactions with other areas of mathematics.
Preface vii
Key developments in algorithmic randomness
1(39)
Johanna N. Y. Franklin
Christopher P. Porter
Algorithmic randomness in ergodic theory
40(18)
Henry Towsner
Algorithmic randomness and constructive/computable measure theory
58(57)
Jason Rute
Algorithmic randomness and layerwise computability
115(19)
Mathieu Hoyrup
Relativization in randomness
134(41)
Johanna N. Y. Franklin
Aspects of Chaitin's Omega
175(31)
George Barmpalias
Biased algorithmic randomness
206(26)
Christopher P. Porter
Higher randomness
232(69)
Benoit Monin
Resource bounded randomness and its applications
301(48)
Donald M. Stull
Index 349
Johanna N. Y. Franklin is an Associate Professor at Hofstra University in Hempstead, NY. She earned her Ph.D. from the Group in Logic and the Methodology of Science at the University of California, Berkeley and has held postdoctoral positions in Singapore, Canada, and the United States. Christopher P. Porter is an Assistant Professor of Mathematics at Drake University in Des Moines, IA. After receiving his Ph.D. in the joint program in mathematics and philosophy at the University of Notre Dame, Porter completed postdoctoral positions at the University of Paris 7 and the University of Florida.
Daugiau apie elektronines knygas Daugiau apie elektronines knygas
Pastovi nuoroda: https://www.kriso.lt/db/97811088082792e.html
Raktažodžiai: