Algorithmically Independent Sequences
From MaRDI portal
Publication:3533009
DOI10.1007/978-3-540-85780-8_14zbMATH Open1159.68012DBLPconf/dlt/CaludeZ08OpenAlexW2570206933WikidataQ57001596 ScholiaQ57001596MaRDI QIDQ3533009FDOQ3533009
Cristian S. Calude, Marius Zimand
Publication date: 30 October 2008
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_14
Recommendations
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80)
Cites Work
- Algorithmic randomness and complexity.
- Title not available (Why is that?)
- The dimensions of individual strings and sequences
- Kolmogorov complexity and Hausdorff dimension
- On partial randomness
- A Theory of Program Size Formally Identical to Information Theory
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The definition of random sequences
- Constructive dimension equals Kolmogorov complexity
- Lowness properties and randomness
- Randomness conservation inequalities; information and independence in mathematical theories
- Calibrating Randomness
- A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
- Title not available (Why is that?)
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- Gödel's theorem and information
- The axiomatization of randomness
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences
- Constructive Dimension and Weak Truth-Table Degrees
- Algorithmically Independent Sequences
Cited In (5)
This page was built for publication: Algorithmically Independent Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3533009)
