ir. Floris Persiau
- ORCID iD
-
0000-0003-1239-9736
Show
Sort by
-
- Journal Article
- A1
- open access
A comparative study of the smallest probability intervals for which a binary sequence is random
-
- Journal Article
- A1
- open access
Randomness and imprecision : from supermartingales to randomness tests
-
- Conference Paper
- P1
- open access
A convenient characterisation of convergent upper transition operators
-
Imprecise probabilities in algorithmic randomness
(2024) -
- Journal Article
- A1
- open access
Imprecision in martingale- and test-theoretic prequential randomness
-
Imprecision in martingale-theoretic prequential randomness
(2023) Proceedings of Machine Learning Research. In Proceedings of Machine Learning Research 215. p.390-400 -
- Journal Article
- A1
- open access
On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness
-
- Conference Paper
- P1
- open access
The smallest probability interval a sequence is random for : a study for six types of randomness
-
- Conference Paper
- P1
- open access
A remarkable equivalence between non-stationary precise and stationary imprecise uncertainty models in computable randomness
(2021) PROCEEDINGS OF MACHINE LEARNING RESEARCH. In Proceedings of Machine Learning Research 147. p.244-253 -
- Conference Paper
- P1
- open access
Computable randomness is about more than probabilities
(2020) SCALABLE UNCERTAINTY MANAGEMENT, SUM 2020. In Lecture Notes in Artificial Intelligence 12322. p.172-186