𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Randomness on Computable Probability Spaces—A

✍ Scribed by Peter Gács; Mathieu Hoyrup; Cristóbal Rojas

Publisher
Springer
Year
2010
Tongue
English
Weight
523 KB
Volume
48
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Schnorr and computable randomness, ma
On Schnorr and computable randomness, martingales, and machines
✍ Rod Downey; Evan Griffiths; Geoffrey Laforte 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 269 KB

## Abstract We examine the randomness and triviality of reals using notions arising from martingales and prefix‐free machines. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

Computational complexity on computable m
Computational complexity on computable metric spaces
✍ Klaus Weirauch 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 344 KB

## Abstract We introduce a new Turing machine based concept of time complexity for functions on computable metric spaces. It generalizes the ordinary complexity of word functions and the complexity of real functions studied by Ko [19] et al. Although this definition of TIME as the maximum of a gene

Concentration Property on Probability Sp
Concentration Property on Probability Spaces
✍ A.A. Giannopoulos; V.D. Milman 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 226 KB

## Introduction 1.1. The starting point of this paper is the notion of concentration for metric probability spaces. Let (X, d, +) be a metric space with metric d and diameter diam(X) 1, which is also equipped with a Borel probability measure +. We then define the concentration function (or ``isoper