Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Chernov, A. Shen, N. Vereshchagin, V. Vovk (2008)
Proc. 19th Int. Conf. on Algorithmic Learning Theory (ALT 2008), Budapest, Hungary, 2008
V. Uspenskii, Alexei Semenov, A. Shen (1990)
Can an individual sequence of zeros and ones be random? Russian Math
A. Chernov, A. Shen, N. Vereshchagin, V. Vovk (2008)
On-Line Probability, Complexity and Randomness
M. Lambalgen (1987)
Von Mises' Definition of Random Sequences ReconsideredJ. Symb. Log., 52
V Uspenskii, A Semenov, A Shen' (1990)
Can an individual sequence of zeros and ones be random?Russian Mathematical Surveys, 45
V.A. Uspensky, A.L. Semenov, A.Kh. Shen’ (1990)
Can an Individual Sequence of Zeros and Ones Be Random?Uspekhi Mat. Nauk, 45
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.
Problems of Information Transmission – Springer Journals
Published: Apr 30, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.