Algorithmically Independent Sequences

DOI10.1007/978-3-540-85780-8_14MaRDI QIDQ3533009zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Marius Zimand, Cristian S. Calude

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

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80)

Recommendations

• Algorithmically independent sequences
• scientific article; zbMATH DE number 3577137
• Finite-state independence
• scientific article; zbMATH DE number 3856078
• Sets of \(K\)-independent strings

Cites work

• scientific article; zbMATH DE number 5354052 (Why is no real title available?)
• scientific article; zbMATH DE number 3930883 (Why is no real title available?)
• scientific article; zbMATH DE number 1911266 (Why is no real title available?)
• scientific article; zbMATH DE number 2216397 (Why is no real title available?)
• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• A Theory of Program Size Formally Identical to Information Theory
• A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
• Algorithmic randomness and complexity.
• Algorithmically Independent Sequences
• Calibrating Randomness
• Constructive Dimension and Weak Truth-Table Degrees
• Constructive dimension equals Kolmogorov complexity
• Gödel's theorem and information
• Kolmogorov complexity and Hausdorff dimension
• Lowness properties and randomness
• On partial randomness
• Randomness conservation inequalities; information and independence in mathematical theories
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The axiomatization of randomness
• The definition of random sequences
• The dimensions of individual strings and sequences

Cited in

(5)

• Algorithmically independent sequences
• The independence of two randomness properties of sequences over finite fields
• On generating independent random strings
• Algorithmically Independent Sequences
• Sets of \(K\)-independent strings

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)