Effective fractal dimensions

DOI10.1002/MALQ.200310127zbMATH Open1058.03044DBLPjournals/mlq/Lutz05OpenAlexW1973073907WikidataQ29399428 ScholiaQ29399428MaRDI QIDQ3159402FDOQ3159402

Authors: Jack H. Lutz 

Publication date: 16 February 2005

Published in: MLQ (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200310127

Recommendations

• scientific article; zbMATH DE number 5269064
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• STACS 2004
• scientific article; zbMATH DE number 2222024
• Effective Hausdorff dimension in general metric spaces

zbMATH Keywords

entropycomputational complexitymartingalesHausdorff dimensionpacking dimensionKolmogorov complexityrandom sequencesconstructive dimensionresource-bounded dimensiongalescircuit-size complexityAlgorithmic information theorypolynomial-time degrees

Mathematics Subject Classification ID

Hausdorff and packing measures (28A78) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Theory of numerations, effectively presented structures (03D45) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
• A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Small Spans in Scaled Dimension
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (34)

• Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
• Complex network dimension and path counts
• Subcomputable Hausdorff function dimension
• Avoiding effective packing dimension 1 below array noncomputable c.e. degrees
• Bounded pushdown dimension vs Lempel Ziv information density
• Generic density and small span theorem
• STACS 2004
• Algorithmic Fractal Dimensions in Geometric Measure Theory
• The typical constructible object
• On zeros of Martin-Löf random Brownian motion
• Solovay reducibility and continuity
• Constructive dimension and Turing degrees
• ALGORITHMS FOR FRACTAL DIMENSION CALCULATION
• Calibrating Randomness
• Effective packing dimension of $\Pi ^0_1$-classes
• Fractal Intersections and Products via Algorithmic Dimension
• Effective Hausdorff dimension in general metric spaces
• Computability versus exact computability of martingales
• Representation of maxitive measures: An overview
• Title not available (Why is that?)
• Effective dimension in some general metric spaces
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• Dimension is compression
• The power of backtracking and the confinement of length
• Base invariance of feasible dimension
• Dimension, entropy rates, and compression
• Effective dimensions and relative frequencies
• Title not available (Why is that?)
• Title not available (Why is that?)
• Completeness, Compactness, Effective Dimensions
• Relative Kolmogorov complexity and geometry
• Martingale families and dimension in P
• Who asked us? How the theory of computing answers questions about analysis
• Title not available (Why is that?)

This page was built for publication: Effective fractal dimensions

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