Please use this identifier to cite or link to this item:
|Title:||How powerful are integer-valued martingales?||Authors:||Bienvenu, L.
|Issue Date:||2010||Citation:||Bienvenu, L.,Stephan, F.,Teutsch, J. (2010). How powerful are integer-valued martingales?. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6158 LNCS : 59-68. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-13962-8_7||Abstract:||In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale (strategy) can win an infinite amount of money by betting on the values of the bits of X. In the classical model, the martingales considered are real-valued, that is, the bets made by the martingale can be arbitrary real numbers. In this paper, we investigate a more restricted model, where only integer-valued martingales are considered, and we study the class of random sequences induced by this model. © 2010 Springer-Verlag Berlin Heidelberg.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/104661||ISBN:||3642139612||ISSN:||03029743||DOI:||10.1007/978-3-642-13962-8_7|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 2, 2020
checked on Mar 28, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.