scientific article; zbMATH DE number 3917706
From MaRDI portal
Publication:3692863
Recommendations
- 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
Cited in
(7)- 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)
