scientific article; zbMATH DE number 5269064

zbMath1144.68030MaRDI QIDQ5384978

Elvira Mayordomo

Publication date: 29 April 2008

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Fractals (28A80) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Theory of numerations, effectively presented structures (03D45)

Related Items (11)

Dimension spectra of lines1 ⋮ Dimension is compression ⋮ Bounded Pushdown Dimension vs Lempel Ziv Information Density ⋮ Bounding the dimension of points on a line ⋮ Fractal Intersections and Products via Algorithmic Dimension ⋮ Randomness and Solovay degrees ⋮ Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable ⋮ Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression ⋮ Effective Hausdorff dimension in general metric spaces ⋮ Unnamed Item ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory

This page was built for publication: