scientific article; zbMATH DE number 1390092

MaRDI QIDQ4934359zbMATH OpenFDO

Authors Ludwig Staiger

Publication date 17 January 2000

zbMATH Keywords

Kolmogorov complexities

Mathematics Subject Classification ID

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

Recommendations

• The Kolmogorov complexity of real numbers.
• The Kolmogorov complexity of random reals
• On Kolmogorov complexity in the real Turing machine setting
• Kolmogorov Complexity Theory over the Reals
• Kolmogorov complexity and set theoretical representations of integers

Cited in

(13)

• Chaitin numbers, Solovay machines, and Gödel incompleteness.
• The Kolmogorov complexity of real numbers.
• Liouville, computable, Borel normal and Martin-Löf random numbers
• Entropic measures, Markov information sources and complexity
• Randomness on full shift spaces
• The Kolmogorov complexity of random reals
• Feasible analysis, randomness, and base invariance
• Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
• Kolmogorov Complexity Theory over the Reals
• Computing a Glimpse of Randomness
• Kolmogorov complexity and set theoretical representations of integers
• New Computational Paradigms
• Kolmogorov complexity conditional to large integers

This page was built for publication:

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