Relations between varieties of kolmogorov complexities
From MaRDI portal
Publication:4879210
Recommendations
Cites work
- A formal theory of inductive inference. Part I
- A Theory of Program Size Formally Identical to Information Theory
- A variant of the Kolmogorov concept of complexity
- Algorithmic Information Theory
- Can an individual sequence of zeros and ones be random?
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- scientific article; zbMATH DE number 3930881 (Why is no real title available?)
- scientific article; zbMATH DE number 3489016 (Why is no real title available?)
- scientific article; zbMATH DE number 3492569 (Why is no real title available?)
- scientific article; zbMATH DE number 3541937 (Why is no real title available?)
- scientific article; zbMATH DE number 736618 (Why is no real title available?)
- scientific article; zbMATH DE number 3206308 (Why is no real title available?)
- Information, randomness and incompleteness. Papers on algorithmic information theory
- On the Length of Programs for Computing Finite Binary Sequences
- On the Length of Programs for Computing Finite Binary Sequences
- On the relation between descriptional complexity and algorithmic probability
- Process complexity and effective random tests
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
Cited in
(42)- Transforming a single-valued transducer into a Mealy machine
- Mathematical metaphysics of randomness
- Almost periodic sequences.
- Inequalities for Shannon entropy and Kolmogorov complexity
- Exact constructive and computable dimensions
- Entropy of high-order Markov chains beyond the pair correlations
- Descriptive complexity of computable sequences revisited
- Cone avoidance and randomness preservation
- Symbolic dynamics: entropy = dimension = complexity
- On partial randomness
- Individual communication complexity
- Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
- Relating and contrasting plain and prefix Kolmogorov complexity
- On Oscillation-Free Chaitin h-Random Sequences
- A Correspondence Principle for Exact Constructive Dimension
- Mass problems and initial segment complexity
- Constructive dimension and Hausdorff dimension: the case of exact dimension
- Increasing the gap between descriptional complexity and algorithmic probability
- scientific article; zbMATH DE number 3889227 (Why is no real title available?)
- Degrees of monotone complexity
- Prefix-free and prefix-correct complexities with compound conditions
- scientific article; zbMATH DE number 3930881 (Why is no real title available?)
- Propagation of partial randomness
- A linearly computable measure of string complexity
- Refined Bounds on Kolmogorov Complexity for ω-Languages
- On oscillation-free -random sequences
- scientific article; zbMATH DE number 7378319 (Why is no real title available?)
- Program size complexity for possibly infinite computations
- Kolmogorov complexity and cellular automata classification
- Kolmogorov's complexity for positive definite matrices
- Kolmogorov entropy in the context of computability theory
- Comparison between the complexity of a function and the complexity of its graph
- Descriptive complexity of computable sequences
- Combinatorial interpretation of Kolmogorov complexity
- Kolmogorov complexity and non-determinism
- Stability of properties of Kolmogorov complexity under relativization
- Algorithmic randomness and monotone complexity on product space
- Entropy measures vs. Kolmogorov complexity
- Error-correcting codes and phase transitions
- Martin-Löf randomness and Galton-Watson processes
- Constructive dimension equals Kolmogorov complexity
- Algorithmic complexity bounds on future prediction errors
This page was built for publication: Relations between varieties of kolmogorov complexities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4879210)
