scientific article; zbMATH DE number 3917706
[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.
- Exact computation for some sequential tests
- Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences
- A computable measure of algorithmic probability by finite approximations with an application to integer sequences
- Algorithmic tests and randomness with respect to a class of measures
- Testing of hypotheses for independency and uniform probability distributions in random sequences
- scientific article; zbMATH DE number 4132084
- scientific article; zbMATH DE number 4119436
- Using ideas of Kolmogorov complexity for studying biological texts
- Conditional tests on basins of attraction with finite fields
- Quick testing of random sequences
- PATTERN DEFINITION AND INFERENCE WITH STOCHASTIC PROCESSES
- scientific article; zbMATH DE number 4054987 (Why is no real title available?)
- On the Kolmogorov-Chaitin Complexity for short sequences
- Two variants of Lempel - Ziv test for binary sequences
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)