Compressibility and Kolmogorov complexity (Q1934957): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 16:33, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Compressibility and Kolmogorov complexity |
scientific article |
Statements
Compressibility and Kolmogorov complexity (English)
0 references
30 January 2013
0 references
In the paper under review, the authors investigated a metric space over \(2^{\omega}\) defined by \(d(x,y)=\overline{\lim}_n \frac{C(x\upharpoonright n|y\upharpoonright n)}{n}\). They prove that, among the others, for any \(\alpha\in [0,1]\), \(d(\alpha\cdot x, \alpha \cdot y)=\alpha\cdot d(x,y)\); and \(2^{\omega}\) is path connected.
0 references
effective Hausdorff dimension
0 references
effective packing dimension
0 references
Kolmogorov complexity
0 references
computability
0 references
effective metric
0 references