Constructive dimension and constructive strong dimension are effectivizations of the Hausdorff and packing dimensions, respectively. Each infinite binary sequence A is assigned a dimension dim(A) in [0,1] and a strong dimension Dim(A) in [0,1].
Aug 18, 2004
Hausdorff dimension – the most extensively studied fractal dimension – has recently been ef- fectivized at several levels of complexity, ...
To classify the strong dimension classes, we use a more powerful effective Borel hierarchy where a coenumerable predicate is used rather than an enumerable ...
Constructive dimension and constructive strong dimension are effectivizations of the Hausdorff and packing dimensions, respectively.
The most fundamental of these effectivizations is constructive dimension, which is closely related to Kolmogorov complexity and algorithmic randomness. Every ...
The most fundamental of these effectivizations is constructive dimension, which is closely related to Kolmogorov complexity and algorithmic randomness. For.
The arithmetical complexity of dimension and randomness | Request ...
www.researchgate.net › ... › Pi
To classify the strong dimension classes, we use a more powerful effective Borel hierarchy where a co-enumerable predicate is used rather than a enumerable ...
Title, "The arithmetical complexity of dimension and randomness" ; Date, 2003 ; In, Proc. 17th International Workshop on Computer Science Logic (Vienna, 2003).
The Arithmetical Complexity of Dimension and Randomness. - DBLP
dblp.org › conf › csl › HitchcockLT03
May 7, 2024 · John M. Hitchcock , Jack H. Lutz, Sebastiaan Terwijn: The Arithmetical Complexity of Dimension and Randomness. CSL 2003: 241-254.
Hitchcock, J. M., Lutz, J. H., & Terwijn, S. A. (2007). The arithmetical complexity of randomness and dimension. ACM Transactions on Computational Logic, ...