Mutual dimension and random sequences

DOI10.1016/J.TCS.2018.04.003MaRDI QIDQ6827456zbMATH OpenFDO

Authors Adam Case, Jack H. Lutz

Publication date 7 June 2018

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2018.04.003

zbMATH Keywords

algorithmic information theory coupled randomness effective fractal dimensions Kolmogorov complexity mutual information

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Review text

The mutual dimensions \(\operatorname{mdim}(x : y)\) and \(\operatorname{Mdim}(x : y)\) have been introduced to quantify the density of algorithmic information shared by two infinite sequences \(x\) and \(y\). The current paper presents an attempt to investigate the relationships between mutual dimension and coupled randomness, which is the algorithmic randomness of two sequences with respect to probability measures that may be dependent on one another.

This page was built for publication: Mutual dimension and random sequences

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