A test for randomness based on a complexity measure

DOI10.1080/03610929308831062MaRDI QIDQ4275809zbMATH OpenOpenAlexFDO

Authors Manuel Martínez Morales, Benjamin S. Duran

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

zbMATH Keywords

complexitycomplexity of finite sequencespowersimulation of binary sequencesstochastic complexitytest of randomness

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• An approximate entropy test for randomness
• A measure of stochastic complexity and its power in testing for randomness.
• Algorithmic tests and randomness with respect to a class of measures
• Algorithmic randomness and measures of complexity
• On the Randomness Complexity of Property Testing
• On the randomness complexity of property testing
• Randomness Tests: Theory and Practice

Cites work

• A formal theory of inductive inference. Part I
• A variant of the Kolmogorov concept of complexity
• Algorithmic Information Theory
• COMPLEXITY OF DESCRIPTIONS OF SYSTEMS: A FOUNDATIONAL STUDY
• Complexity-based induction systems: Comparisons and convergence theorems
• scientific article; zbMATH DE number 3433226 (Why is no real title available?)
• scientific article; zbMATH DE number 3214063 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• scientific article; zbMATH DE number 3354418 (Why is no real title available?)
• scientific article; zbMATH DE number 3371888 (Why is no real title available?)
• Logical basis for information theory and probability theory
• Modeling by shortest data description
• On grammars, complexity, and information measures of biological macromolecules
• On the Complexity of Finite Sequences
• On the concept of a random sequence
• Process complexity and effective random tests
• Stochastic complexity and modeling
• 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
• Universal coding, information, prediction, and estimation

Cited in

(9)

• Oscillation measures as randomness tests
• A new test for randomness and its application to some cryptographic problems
• Algorithmic tests and randomness with respect to a class of measures
• A measure of stochastic complexity and its power in testing for randomness.
• New test sizes up randomness
• Numerical characteristics of randomness for binary samples
• Evaluating the randomness based on spectral density
• An approximate entropy test for randomness
• On a Test for Randomness Based on Signs of Differences

This page was built for publication: A test for randomness based on a complexity measure

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