English

Notes on random reals

Computational Complexity 2012-09-14 v1

Abstract

The theory of random real numbers is exceedingly well-developed, and fascinating from many points of view. It is also quite challenging mathematically. The present notes are intended as no more than a gateway to the larger theory. They review just the most elementary part of the theory (bearing on Kolmogorov- and ML-randomness). We hope that the simple arguments presented here will encourage the enterprising student to examine richer treatments of the subject available elsewhere, notably, in Downey and Hirschfeldt (2010).

Cite

@article{arxiv.1209.2875,
  title  = {Notes on random reals},
  author = {Daniel Osherson and Scott Weinstein},
  journal= {arXiv preprint arXiv:1209.2875},
  year   = {2012}
}

Comments

26 pages

R2 v1 2026-06-21T22:04:22.129Z