Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Revision(s):

Revision #3 to TR01-059 | 12th July 2002 00:00

RSS-Feed




Revision #3
Authors: Elvira Mayordomo
Accepted on: 12th July 2002 00:00
Downloads: 1281
Keywords: 


Abstract:


Revision #2 to TR01-059 | 30th May 2002 00:00

A Kolmogorov complexity characterization of constructive Hausdorff dimension





Revision #2
Authors: Elvira Mayordomo
Accepted on: 30th May 2002 00:00
Downloads: 1245
Keywords: 


Abstract:


Revision #1 to TR01-059 | 19th April 2002 00:00

A Kolmogorov complexity characterization of constructive Hausdorff dimension





Revision #1
Authors: Elvira Mayordomo
Accepted on: 19th April 2002 00:00
Downloads: 1264
Keywords: 


Abstract:


Paper:

TR01-059 | 20th July 2001 00:00

A Kolmogorov complexity characterization of constructive Hausdorff dimension





TR01-059
Authors: Elvira Mayordomo
Publication: 3rd September 2001 11:45
Downloads: 1340
Keywords: 


Abstract:

We obtain the following full characterization of constructive dimension
in terms of algorithmic information content. For every sequence A,
cdim(A)=liminf_n (K(A[0..n-1])/n.



ISSN 1433-8092 | Imprint