Algorithmic randomness and splitting of supermartingales

Simple item page
dc.creatorMuchnik, Andrej
dc.date2008-07-21
dc.date2008-11-28
dc.date.accessioned2026-07-07T12:04:59Z
dc.date.available2026-07-07T12:04:59Z
dc.descriptionRandomness 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 the even bits (the first one) and on the odd bits (the second one) knowing all preceding bits.
dc.descriptionThe same text in English (13 pages) and in Russian (14 pages). Journal version
dc.identifierhttps://arxiv.org/abs/0807.3156
dc.identifierhttp://arxiv.org/abs/0807.3156
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/208265
dc.subjectInformation Theory
dc.titleAlgorithmic randomness and splitting of supermartingales
dc.typetext

Files

Collections

arXiv