No label defined (Q3692863)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3917706
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3917706

      Statements

      0 references
      1985
      0 references
      [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.
      0 references

      Identifiers