A simple proof of Miller-Yu theorem

MaRDI QIDQ3505881zbMATH OpenFDO

Authors Laurent Bienvenu, Wolfgang Merkle, A. Shen

Publication date 11 June 2008

zbMATH Keywords

Kolmogorov complexityMartin-Löf randomness

Mathematics Subject Classification ID

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

Recommendations

• Limit complexities revisited
• Limit complexities revisited
• Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
• Initial segment complexities of randomness notions
• Pointed computations and Martin-Löf randomness

Cited in

(5)

• Another simple proof of a theorem of Milner
• Randomness and initial segment complexity for measures
• scientific article; zbMATH DE number 943895 (Why is no real title available?)
• Martin-Löf random quantum states
• Kolmogorov complexity in perspective. I: Information theory and randomness

This page was built for publication: A simple proof of Miller-Yu theorem

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