Hierarchies of randomness tests

MaRDI QIDQ3434496zbMATH OpenFDO

Authors Jan Reimann, Frank Stephan

Publication date 2 May 2007

zbMATH Keywords

Kolmogorov complexityMartin-Löf testpartial randomnessSolovay test

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• On partial randomness
• Some results on effective randomness
• Difference randomness
• Automata, Languages and Programming
• Schnorr randomness

Cited in

(20)

• Energy randomness
• Exact constructive and computable dimensions
• Subcomputable Hausdorff function dimension
• Searching for shortest and least programs
• Universality, optimality, and randomness deficiency
• Symbolic dynamics: entropy = dimension = complexity
• Some results on effective randomness
• On partial randomness
• On Oscillation-Free Chaitin h-Random Sequences
• Phase transition between unidirectionality and bidirectionality
• Constructive dimension and Hausdorff dimension: the case of exact dimension
• Partial Randomness and Dimension of Recursively Enumerable Reals
• Algorithmic information theory and its statistical mechanical interpretation
• Fixed Point Theorems on Partial Randomness
• Propagation of partial randomness
• Fixed point theorems on partial randomness
• On oscillation-free -random sequences
• Automata, Languages and Programming
• Randomness with respect to c.e. semimeasures
• Representation of left-computable \(\varepsilon \)-random reals

This page was built for publication: Hierarchies of randomness tests

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