Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity

DOI10.1007/978-3-540-70918-3_23zbMATH Open1186.68225OpenAlexW1601300069MaRDI QIDQ3590938FDOQ3590938

Authors: Laurent Bienvenu 

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_23

Recommendations

• Kolmogorov-Loveland stochasticity and Kolmogorov complexity
• Kolmogorov complexity
• scientific article; zbMATH DE number 5294121
• scientific article; zbMATH DE number 2196513
• scientific article; zbMATH DE number 107775
• Kolmogorov complexity and non-determinism
• Approximating Kolmogorov complexity
• STACS 2005

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited In (11)

• Kolmogorov Complexity and Algorithmic Randomness
• Kolmogorov-Loveland stochasticity and Kolmogorov complexity
• An empirical study of the complexity and randomness of prediction error sequences
• STACS 2005
• Title not available (Why is that?)
• STACS 2005
• Kolmogorov-Loveland stochasticity for finite strings
• ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS
• Kolmogorov complexity and non-determinism
• Title not available (Why is that?)
• Some notes on Rissanen's stochastic complexity

This page was built for publication: Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity

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