Finite-state relative dimension, dimensions of A. P. subsequences and a finite-state van Lambalgen's theorem
From MaRDI portal
Publication:6543262
DOI10.1016/J.IC.2024.105156MaRDI QIDQ6543262FDOQ6543262
Authors: S. Nandakumar, Subin Pulari, Akhil S
Publication date: 24 May 2024
Published in: Information and Computation (Search for Journal in Brave)
van Lambalgen's theoremfinite-state relative dimensionWall's theorem on the normality of A. P. subsequences
Cites Work
- Title not available (Why is that?)
- Algorithmic randomness and complexity.
- Endliche Automaten und Zufallsfolgen
- Subsequences of normal sequences
- Entropy rates and finite-state dimension
- When van Lambalgen’s Theorem fails
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Two characterizations of finite-state dimension
- Higher order concentration for functions of weakly dependent random variables
- Uniform van Lambalgen's theorem fails for computable randomness
- Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
- Title not available (Why is that?)
- Finite-state independence
- Towards a sharp converse of Wall's theorem on arithmetic progressions
- On Resource-Bounded Versions of the van Lambalgen Theorem
This page was built for publication: Finite-state relative dimension, dimensions of A. P. subsequences and a finite-state van Lambalgen's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6543262)