2016/12/28 by Vladimir Vovk, Vovk, Vladimir
Computer Science · #Computability, Logic, AI Algorithms #semigroups and automata theory #Algorithms and Data Compression
paper · pdf · doi:10.48550/arxiv.1612.08859
The first part of this paper is another English translation of a 1986 note. It gives a natural definition of a finite Bernoulli sequence (i.e., a typical realization of a finite sequence of binary IID trials) and compares it with the Kolmogorov--Martin-Lof definition, which is interpreted as defining exchangeable sequences. The appendix gives the historical background and proofs.