Effective packing dimension of $\Pi ^0_1$-classes

DOI10.1090/S0002-9939-08-09335-0zbMath1204.03045OpenAlexW1508654898MaRDI QIDQ3533884

Chris J. Conidis

Publication date: 24 October 2008

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-08-09335-0

zbMATH Keywords

correspondence principleeffective packing dimensionupper box dimensionclassical packing dimension

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Theory of numerations, effectively presented structures (03D45)

Related Items (3)

A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one ⋮ Effectively closed sets of measures and randomness ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correspondence principles for effective dimensions
• The dimensions of individual strings and sequences
• Algorithmic Randomness and Complexity
• Randomness and Computability: Open Questions
• Calibrating Randomness
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• Computability and Randomness
• Computability Theory and Differential Geometry

This page was built for publication: Effective packing dimension of $\Pi ^0_1$-classes