Abstract:
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.
Key words:the prediction machine, general regular superevent, prediction of superevents by machine.
Fulltext:
PDF file (3726 kB)