Predictive complexity is a generalisation of Kolmogorov complexity motivated by an on-line prediction scenario. It quantifies “unpredictability” of a sequence in a particular prediction environment. This paper surveys key results on predictive complexity for games with finitely many outcomes. The issues of existence, non-existence, uniqueness, and linear inequalities are covered.

In this work, we show that Spearman’s correlation coefficient test about H0:ρs=0 found in most statistical software is theoretically incorrect and performs poorly when bivariate normality assumptions are not met or the sample size small. There common misconception tests ρs=0 robust to deviations from normality. However, under certain scenarios violation of assumption has severe effects on type ...

La correlación es una medida estadística que permite conocer el grado de asociación lineal entre dos variables cuantitativas u ordinales (X, Y). También determina la fuerza y dirección toma esta relación mediante cálculo del coeficiente correlación, cuyo resultado puede variar en intervalo [-1, +1]. Entre más cercano a 1 sea mayor asociación. Cuando aleatoria o no existe, tiende cero. Los coefi...

This research is expected to find out the relationship between physical activity and academic performance of students during online learning Covid-19 pandemic. a scientific review (non trial) with Cross Sectional approach methodology. Sampling this by purposive sampling method. totaling 154 (n=154). Data collection using IPAQ SCLS questionnaires. In analyzing data here, univariate bivariate fre...

A methodology based on the algorithmic complexity theory has been applied to assess the relative efficiency of the stocks listed on Bovespa. We provide eight alternative listings of the top ten stocks according to their efficiency rates.

We show that there are infinitely many binary strings z, such that the sum of the on-line decision complexity of predicting the even bits of z given the previous uneven bits, and the decision complexity of predicting the uneven bits given the previous event bits, exceeds the Kolmogorov complexity of z by a linear term in the length of z.

BACKGROUND Despite several polysomnographic studies on periodic leg movements (PLM) in healthy sleep, data on the prevalence and characteristics of periodic arm movements (PAM) in normal subjects are lacking. We aimed to investigate PAM and their association with PLM during wakefulness and sleep in healthy subjects. METHODS Ninety-one participants underwent video-polysomnography according to ...