Subcomputable Hausdorff function dimension

DOI10.1016/J.TCS.2021.08.027MaRDI QIDQ2235747zbMATH OpenOpenAlexFDO

Authors Claude Sureson

Publication date 21 October 2021

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

Full work available at URL https://doi.org/10.1016/j.tcs.2021.08.027

zbMATH Keywords

algorithmic randomnessHausdorff dimension

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• scientific article; zbMATH DE number 2222024
• scientific article; zbMATH DE number 2216397
• Effective fractal dimensions
• Diagonally non-recursive functions and effective Hausdorff dimension
• scientific article; zbMATH DE number 2086652

Cites work

• A Correspondence Principle for Exact Constructive Dimension
• A separation of two randomness concepts
• Algorithmic randomness and complexity.
• Computability and randomness
• Constructive dimension and Hausdorff dimension: the case of exact dimension
• Correspondence principles for effective dimensions
• Dimension in Complexity Classes
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• Exact constructive and computable dimensions
• Hierarchies of randomness tests
• scientific article; zbMATH DE number 1670880 (Why is no real title available?)
• scientific article; zbMATH DE number 44693 (Why is no real title available?)
• scientific article; zbMATH DE number 1555954 (Why is no real title available?)
• scientific article; zbMATH DE number 2216397 (Why is no real title available?)
• scientific article; zbMATH DE number 2222024 (Why is no real title available?)
• Kolmogorov complexity and Hausdorff dimension
• On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
• Resource bounded randomness and computational complexity
• Scaled dimension and nonuniform complexity
• Schnorr dimension
• Sub-computable Boundedness Randomness
• Subcomputable Schnorr randomness
• The complexity and effectiveness of prediction algorithms
• The dimensions of individual strings and sequences
• Theory of computation
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)

Cited in

(5)

• Computing the Hausdorff dimension of subshifts using matrices
• scientific article; zbMATH DE number 2079882 (Why is no real title available?)
• The Inverse of Ackermann Function is Computable in Linear Time
• Effective aspects of Hausdorff and Fourier dimension
• Diagonally non-recursive functions and effective Hausdorff dimension

This page was built for publication: Subcomputable Hausdorff function dimension

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