Upper estimate of partial prediction degree for general regular superevents
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2019), pp. 10-16
Voir la notice de l'article provenant de la source Math-Net.Ru
A machine predicts the next character in the input sequence if it outputs that character at the previous moment of time. In this paper for some general regular superevents we study the upper bound on prediction degree. The paper presents an upper bound for superevents predicted by the machine representing the superevents. In addition, the class of superevents is presented for which this bound is obtained.
@article{VMUMM_2019_5_a1,
author = {I. K. Vedernikov},
title = {Upper estimate of partial prediction degree for general regular superevents},
journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
pages = {10--16},
publisher = {mathdoc},
number = {5},
year = {2019},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMUMM_2019_5_a1/}
}
TY - JOUR AU - I. K. Vedernikov TI - Upper estimate of partial prediction degree for general regular superevents JO - Vestnik Moskovskogo universiteta. Matematika, mehanika PY - 2019 SP - 10 EP - 16 IS - 5 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VMUMM_2019_5_a1/ LA - ru ID - VMUMM_2019_5_a1 ER -
I. K. Vedernikov. Upper estimate of partial prediction degree for general regular superevents. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2019), pp. 10-16. http://geodesic.mathdoc.fr/item/VMUMM_2019_5_a1/