| Partner: dr Dariusz Kalociński |
|
Promotor prac doktorskich
| 1. | 2020-10-15 pomocniczy | Steifer Tomasz  (Instytut Podstaw Informatyki PAN) | Computable prediction of infinite binary sequences with zero one loss |
Ostatnie publikacje
| 1. | Kalociński D.♦, Steifer T., On unstable and unoptimal prediction, MATHEMATICAL LOGIC QUARTERLY, ISSN: 1521-3870, DOI: 10.1002/malq.201800085, Vol.65, No.2, pp.218-227, 2019 Streszczenie: We consider the notion of prediction functions (or predictors) studied before in the context of randomness and stochasticity by Ko, and later by Ambos‐Spies and others. Predictor is a total computable function which tries to predict bits of some infinite binary sequence. The prediction error is defined as the limit of the number of incorrect answers divided by the number of answers given so far. We discuss indefiniteness of prediction errors for weak 1‐generics and show that this phenomenon affects certain c.e. sequences as well. On the other hand, a notion of optimal predictor is considered. It is shown that there is a sequence for which increasingly better predictors exist but for which no predictor is optimal. Afiliacje autorów:
|  | 100p. |
Prace konferencyjne
| 1. | Kalociński D.♦, Steifer T., An Almost Perfectly Predictable Process with No Optimal Predictor, IEEE-ISIT, IEEE International Symposium on Information Theory, 2019-07-07/07-12, Paryż (FR), DOI: 10.1109/ISIT.2019.8849587, pp.2504-2508, 2019 Streszczenie: A novel kind of a negative result is presented for the problem of computable prediction. A non-stationary binary stochastic process is constructed for which almost surely no effective method of prediction achieves the infimum of prediction errors defined as the normalized Hamming distance between the sequence of predictions and the realization of the process. Yet it is shown that this process may be effectively predicted almost surely up to an arbitrarily small error since the infimum of prediction errors is zero. Afiliacje autorów:
|  |