Effective-Strong-Dimension，-Algorithmic-Information，-and-Computational-Complexity.pdf

3 0 0 2 n Effective Strong Dimension, Algorithmic Information, a J 6 and Computational Complexity ] C C Krishna B. Athreya 1 John M. Hitchcock 2 Jack H. Lutz 3 s. Elvira Mayordomo 4 c [ 3 v 5 2 0 1 1 2 0 / s c : v i X r a 1School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY 14853, USA and Departments of Mathematics and Statistics, Iowa State University, Ames, IA 50011, USA. kba@iastate.edu. This research was supported in part by Air Force Office of Scientific Research Grant ITSI F 49620-01-1-0076. 2Department of Computer Science, Iowa State University, Ames, IA 50011, USA. jhitchco@cs.iastate.edu. This research was supported in part by National Science Foundation Grant 9988483. 3Department of Computer Science, Iowa State University, Ames, IA 50011, USA. lutz@cs.iastate.edu. This research was supported in part by National Science Foundation Grant 9988483. 4Departamento de Inform´atica e Ingenier´ıa de Sistemas, Universidad de Zaragoza, 50015 Zaragoza, SPAIN. elvira@posta.unizar.es. This research was supported in part by Spanish Government MEC project PB98-0937-C04-02 and by National Science Foundation Grant 9988483. It was done while visiting Iowa State University. Abstract The two most important notions of fractal dimension are Hausdorff dimension, developed by Haus- dorff (1919), and packing dimension, developed independently by Tricot (1982) and Sullivan (1984). Both dimensions have the mathematical advantage of being defined from measures, and both have yielded extensive applications in fractal geometry and dynamical systems. Lutz (2000) has recently proven a simple characteri