DocumentCode
3243064
Title
Hausdorff dimension in exponential time
Author
Ambos-Spies, Klaus ; Merkle, Wolfgang ; Reimann, Jan ; Stephan, Frank
Author_Institution
Math. Inst., Heidelberg Univ., Germany
fYear
2001
fDate
2001
Firstpage
210
Lastpage
217
Abstract
In this paper we investigate effective versions of Hausdorff dimension which have been recently introduced by Lutz. We focus on dimension in the class E of sets computable in linear exponential time. We determine the dimension of various classes related to fundamental structural properties including different types of autoreducibility and immunity. By a new general invariance theorem for resource-bounded dimension we show that the class of p-m-complete sets for E has dimension 1 in E. Moreover, we show that there are p-m-lower spans in E of dimension ℋ(β) for any rational β between 0 and 1, where ℋ(β) is the binary entropy function. This leads to a new general completeness notion for E that properly extends Lutz´s concept of weak completeness. Finally we characterize resource-bounded dimension in terms of martingales with restricted betting ratios and in terms of prediction functions
Keywords
computability; computational complexity; Hausdorff dimension; computable; exponential time; invariance theorem; martingales; prediction functions; resource-bounded dimension; restricted betting ratios; Complexity theory; Entropy; Fractals; Information theory; Mathematics; Particle measurements; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Complexity, 16th Annual IEEE Conference on, 2001.
Conference_Location
Chicago, IL
Print_ISBN
0-7695-1053-1
Type
conf
DOI
10.1109/CCC.2001.933888
Filename
933888
Link To Document