A test for randomness based on a complexity measure
From MaRDI portal
Publication:4275809
DOI10.1080/03610929308831062zbMath0796.62008OpenAlexW2051521652MaRDI QIDQ4275809
Benjamin S. Duran, Manuel Martinez Morales
Publication date: 31 January 1994
Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610929308831062
complexitypowerstochastic complexitytest of randomnesscomplexity of finite sequencessimulation of binary sequences
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Statistical aspects of information-theoretic topics (62B10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stochastic complexity and modeling
- Modeling by shortest data description
- On grammars, complexity, and information measures of biological macromolecules
- Process complexity and effective random tests
- Universal coding, information, prediction, and estimation
- Algorithmic Information Theory
- On the Complexity of Finite Sequences
- COMPLEXITY OF DESCRIPTIONS OF SYSTEMS: A FOUNDATIONAL STUDY
- Complexity-based induction systems: Comparisons and convergence theorems
- Logical basis for information theory and probability theory
- A variant of the Kolmogorov concept of complexity
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The definition of random sequences
- A formal theory of inductive inference. Part I
- On the concept of a random sequence
This page was built for publication: A test for randomness based on a complexity measure
