PROBABILISTIC ALGORITHMIC RANDOMNESS.

We introduce martingales defined by probabilistic strategies, in which randomness is used to decide whether to bet. We show that different criteria for the success of computable probabilistic strategies can be used to characterize ML-randomness, computable randomness, and partial computable randomne...

Full description

Bibliographic Details

Published in:	Journal of Symbolic Logic Vol. 78; no. 2; pp. 579 - 602
Main Authors:	BUSS, SAM, MINNES, MIA
Format:	Article
Published:	Cambridge University Press Jun2013
Subjects:	Martingales (Mathematics) Probability theory Kolmogorov complexity Equivalence classes (Set theory) Mathematical functions Mathematical models
Online Access:	View this record in EBSCOhost