Algorithmic randomness and splitting of supermartingales
classification
💻 cs.IT
math.IT
keywords
bitssupermartingalesrandomnessalgorithmiccannotdefinedevenfirst
read the original abstract
Randomness in the sense of Martin-L\"of 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 the even bits (the first one) and on the odd bits (the second one) knowing all preceding bits.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.