scientific article; zbMATH DE number 3917706

From MaRDI portal
Publication:3692863





[For the entire collection see Zbl 0568.00020.] A mathematical model is presented which enables to give a meaningful interpretation to the assertion with a probability greater than 1- \(\epsilon\) the finite sequence of letters under consideration is an initial segment of a relatively simple infinite recursive sequence and to give an at least potential possibility how to test the validity of such an assertion. The model is based on a modified version of Kolmogorov algorithmic complexity of sequences of letters and the results are compared with those offered by the classical statistical hypothesis testing theory.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3692863)