Muutke küpsiste eelistusi

E-raamat: Algorithmic Randomness: Progress and Prospects

Edited by (Hofstra University, New York), Edited by (Drake University, Iowa)
  • Formaat: PDF+DRM
  • Sari: Lecture Notes in Logic
  • Ilmumisaeg: 07-May-2020
  • Kirjastus: Cambridge University Press
  • Keel: eng
  • ISBN-13: 9781108808279
  • Formaat - PDF+DRM
  • Hind: 142,03 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: PDF+DRM
  • Sari: Lecture Notes in Logic
  • Ilmumisaeg: 07-May-2020
  • Kirjastus: Cambridge University Press
  • Keel: eng
  • ISBN-13: 9781108808279

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

"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"--

Muu info

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.