Gales suffice for constructive dimension

Information Processing Letters

Volumn 86, Issue 1, 2003, Pages 9-12

  Hitchcock, John M ^a  

^a Iowa State University   (United States)

Author keywords

Computational complexity; Constructive dimension; Gales

Indexed keywords

BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; DATA PROCESSING; THEOREM PROVING;

SUPERMARTINGALES;

COMPUTER SCIENCE;

EID: 0037447594     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00454-4     Document Type: Article

References (9)

1. Hitchcock J.M. Correspondence principles for effective dimensions. Proceedings of the 29th International Colloquium on Automata, Languages, and Programming. 2002;561-571.
2. Lutz J.H. Almost everywhere high nonuniform complexity. J. Comput. System Sci. 44:1992;220-258.
3. Lutz J.H. Dimension in complexity classes. Proceedings of the 15th Annual IEEE Conference on Computational Complexity. 2000;158-169 IEEE Computer Society Press. Updated version appears as ACM Computing Research Repository Technical Report cs.CC/0203016, 2002.
4. Lutz J.H. Gales and the constructive dimension of individual sequences. Proceedings of the 27th International Colloquium on Automata, Languages, and Programming. 2000;902-913 Springer, Berlin. Revised as [5].
5. J.H. Lutz, The dimensions of individual strings and sequences, Information and Computation, Available as ACM Computing Research Repository Technical Report cs.CC/0203017, 2002, To appear.
6. Martin-Löf P. The definition of random sequences. Inform. and Control. 9:1966;602-619.
7. Schnorr C.P. A unified approach to the definition of random sequences. Math. Systems Theory. 5:1971;246-258.
8. Schnorr C.P. Zufälligkeit und Wahrscheinlichkeit. Lecture Notes in Math. 218:1971.
9. Zvonkin A.K., Levin L.A. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Math. Surv. 25:1970;83-124.