Universal sequence prediction can fail to converge on some computable patterns, but squared error stays bounded
For some computable patterns the per-bit errors of universal sequence prediction do not sum to a bounded value, yet their squares are bounded exponentially in the pattern's program length, and polynomially when a computable classification function fixes the bits.