A level of Martin-Lof randomness.

MaRDI QIDQ2898374zbMATH OpenFDO

Authors Bradley S. Tice

Publication date 11 July 2012

zbMATH Keywords

compression algorithmKolmogorov complexityMartin-L\"f randomnessmodified symbolic space multiplier programrandom sequential string

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Other physical applications of random processes (60K40) Applications of statistics in engineering and industry; control charts (62P30) Applications of statistics to physics (62P35) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Algorithmic randomness and complexity.
• The combinatorial complexity of a finite string
• Computability and randomness
• scientific article; zbMATH DE number 736618
• Randomness, computation and mathematics

Cited in

(3)

• Constraints placed on random sequences by their compressibility
• scientific article; zbMATH DE number 1542825 (Why is no real title available?)
• Kobayashi compressibility

This page was built for publication: A level of Martin-Lof randomness.

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