On elementary computability-theoretic properties of algorithmic randomness

MaRDI QIDQ2703742zbMATH OpenFDO

Authors A. Arslanov

Publication date 8 May 2001

zbMATH Keywords

\(K\)-bounded sequencesChaitin's randomnessself-delimiting complexity measure

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Randomness for computable measures and initial segment complexity
• scientific article; zbMATH DE number 1531917
• Algorithmic randomness and measures of complexity
• scientific article; zbMATH DE number 5264766
• On relative randomness

Cited in

(10)

• Constructivity conditions on immune sets
• Computational Randomness from Generalized Hardcore Sets
• Effective Brenier Theorem
• Lowness, Randomness, and Computable Analysis
• Computable Measure Theory and Algorithmic Randomness
• A relation between correctness and randomness in the computation of probabilistic algorithms
• scientific article; zbMATH DE number 5657607 (Why is no real title available?)
• A quest for algorithmically random infinite structures
• Ergodic-Type Characterizations of Algorithmic Randomness
• Theorems on the variable-length intrinsic randomness

This page was built for publication: On elementary computability-theoretic properties of algorithmic randomness

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