Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Floris Persiau"'
Publikováno v:
International Journal of Approximate Reasoning. 151:272-291
The field of algorithmic randomness studies what it means for infinite binary sequences to be random for some given uncertainty model. Classically, martingale-theoretic notions of such randomness involve precise uncertainty models, and it is only rec
Publikováno v:
Scalable Uncertainty Management-14th International Conference, SUM 2020, Bozen-Bolzano, Italy, September 23–25, 2020, Proceedings
Scalable Uncertainty Management, 14th International Conference, SUM 2020
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Scalable Uncertainty Management
Lecture Notes in Computer Science ISBN: 9783030584481
SUM
Scalable Uncertainty Management, 14th International Conference, SUM 2020
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Scalable Uncertainty Management
Lecture Notes in Computer Science ISBN: 9783030584481
SUM
We introduce a notion of computable randomness for infinite sequences that generalises the classical version in two important ways. First, our definition of computable randomness is associated with imprecise probability models, in the sense that we c