Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Algorithmic randomness and splitting of supermartingales

Algorithmic randomness and splitting of supermartingales Randomness in the sense of Martin-Löf can be defined in terms of lower semicomputable supermartingales. We show that such a supermartingale cannot be replaced by a pair of supermartingales that bet only on even bits (the first one) and on odd bits (the second one) knowing all the preceding bits. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

Algorithmic randomness and splitting of supermartingales

Problems of Information Transmission , Volume 45 (1) – Apr 30, 2009

Loading next page...
1
 
/lp/springer_journal/algorithmic-randomness-and-splitting-of-supermartingales-C7w2iC2uwf

References (6)

Publisher
Springer Journals
Copyright
Copyright © 2009 by Pleiades Publishing, Ltd.
Subject
Engineering; Systems Theory, Control; Information Storage and Retrieval; Electrical Engineering; Communications Engineering, Networks
ISSN
0032-9460
eISSN
1608-3253
DOI
10.1134/S0032946009010074
Publisher site
See Article on Publisher Site

Abstract

Randomness in the sense of Martin-Löf can be defined in terms of lower semicomputable supermartingales. We show that such a supermartingale cannot be replaced by a pair of supermartingales that bet only on even bits (the first one) and on odd bits (the second one) knowing all the preceding bits.

Journal

Problems of Information TransmissionSpringer Journals

Published: Apr 30, 2009

There are no references for this article.