The arithmetical complexity of dimension and randomness

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2803, Issue , 2003, Pages 241-254

  Hitchcock, John M ^a   Lutz, Jack H ^a   Terwijn, Sebastiaan A ^b,c  

^a Iowa State University   (United States)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ARITHMETICAL COMPLEXITY; BOREL HIERARCHY; CONSTRUCTIVE DIMENSION; HAUSDORFF; PACKING DIMENSION; RANDOM SEQUENCE;

BINARY SEQUENCES;

EID: 35248858826     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45220-1_21     Document Type: Article

References (27)

1. K. Ambos-Spies, W. Merkle, J. Reimann, and F. Stephan. Hausdorff dimension in exponential time. In Proceedings of the 16th IEEE Conference on Computational Complexity, pages 210-217, 2001.
2. K. B. Athreya, J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. Effective strong dimension, algorithmic information, and computational complexity. Technical Heport cs.CC/0211025, Computing Research Repository, 2002.
3. J. J. Dai, J. I. Lathrop, J. H. Lutz, and E. Mayordomo. Finite-state dimension. Theoretical Computer Science. To appear.
4. S. A. Fenner. Gales and supergales are equivalent for defining constructive Hausdorff dimension. Technical Report cs.CC/0208044, Computing Research Repository, 2002.
5. L. Fortnow and J. H. Lutz. Prediction and dimension. In Proceedings of the 15th Annual Conference on Computational Learning Theory, pages 380-395, 2002.
6. F. Hausdorff. Dimension und äusseres Mass. Mathematische Annalen, 79:157-179, 1919.
7. J. M. Hitchcock. Fractal dimension and logarithmic loss unpredictability. Theoretical Computer Science. To appear.
8. J. M. Hitchcock. MAX3SAT is exponentially hard to approximate if NP has positive dimension. Theoretical Computer Science, 289(1):861-869, 2002.
9. J. M. Hitchcock. Gales suffice for constructive dimension. Information Processing Letters, 86(1):9-12, 2003.
10. C. G. Jockusch. Degrees of generic sets. In Recursion Theory: its Generalizations and Applications, volume 45 of London Mathematical Society Lecture Notes Series, pages 110-139. Cambridge University Press, 1980.
11. H. Ki and T. Linton. Normal numbers and subsets of N with given densities. Fundamenta Mathematicae, 144:163-179, 1994.
12. G. Kreisel. Note on arithmetical models for consistent formulae of the predicate calculus. Fundamenta Mathematicae, 37:265-285, 1950.
13. M. Li and P. M. B. Vitányi. An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, Berlin, 1997. Second Edition.
14. J. H. Lutz. Dimension in complexity classes. SIAM Journal on Computing. To appear.
15. J. H. Lutz. The dimensions of individual strings and sequences. Information and Computation. To appear.
16. P. Martin-Löf. The definition of random sequences. Information and Control, 9:602-619, 1966.
17. E. Mayordomo. A Kolmogorov complexity characterization of constructive Hausdorff dimension. Information Processing Letters, 84(1):1-3, 2002.
18. P. Odifreddi. Classical recursion theory, volume 125 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1989.
19. H. Rogers, Jr. Theory of Recursive Functions and Effective Computability. McGraw - Hill, New York, N.Y., 1967.
20. C. P. Schnorr. Zufälligkeit und Wahrscheinlichkeit. Lecture Notes in Mathematics, 218, 1971.
21. L. Staiger. Recursive automata on infinite words. In Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, pages 629-639, 1993.
22. L. Staiger. On the power of reading the whole infinite input tape. In C. S. Calude and Gh. Paun, editors, Finite Versus Infinite: Contributions to an Eternal Dilemma, pages 335-348. Springer-Verlag, 2000.
23. L. Staiger. Constructive dimension equals Kolmogorov complexity. Technical Report CDMTCS-210, University of Auckland, January 2003.
24. S. A. Terwjjn. Complexity and randomness. Technical Report CDMTCS-212, University of Auckland, March 2003. Notes for a course given at the University of Auckland.
25. M. van Lambalgen. Random Sequences. PhD thesis, Department of Mathematics, University of Amsterdam, 1987.
26. J. Ville. Étude Critique de la Notion de Collectif. Gauthier-Villars, Paris, 1939.
27. Y. Wang. Randomness and Complexity. PhD thesis, Department of Mathematics, University of Heidelberg, 1996.