Abstract

A constructive version of Hausdorff dimension is developed using constructive supergales, which are betting strategies that generalize the constructive supermartingales used in the theory of individual random sequences. This constructive dimension is used to assign every individual (infinite, binary) sequence S a dimension, which is a real number dim(S) in the interval [0, 1]. Sequences that

Citations

6514	Elements of Information Theory - Cover, Thomas - 1991
1412	An Introduction to Kolmogorov Complexity and Its Applications - Li, Vitanyi - 1997
429	Fractal Geometry - Mathematical Foundations and Applications - Falconer - 1990
411	Recursively Enumerable Sets and Degrees - Soare - 1987
294	The definition of random sequences - Martin-Löf
283	Classical Recursion Theory - Odifreddi - 1999
274	A theory of program size formally identical to information theory - Chaitin - 1975
228	The Geometry of Fractal Sets - Falconer - 1986
209	Ergodic Theory and Information - Billingsley - 1965
171	Descriptive Set Theory - Moschovakis - 1980
133	Zufälligkeit und Wahrscheinlichkeit - Schnorr - 1971
96	Dimension in complexity classes - Lutz
91	On the notion of a random sequence - Levin - 1973
81	Theory of Recursive Functions and Eective Computability McGraw-Hill Pub - Rogers - 1967
64	Laws of information conservation (non-growth) and aspects of the foundations of probability theory - Levin - 1974
60	A Kolmogorov complexity characterization of constructive Hausdorff dimension - Mayordomo - 2002
55	Random sequences - Lambalgen - 1987
40	The combinatorial foundations of information theory and the probability calculus - Kolmogorov - 1983
37	Gales and the constructive dimension of individual sequences - Lutz
37	A tight upper bound on Kolmogorov complexity and uniformly optimal prediction - Staiger - 1998
33	Incompleteness theorems for random reals - Chaitin - 1987
32	A formal theory of inductive inference - Solomono - 1964
30	Hartmanis: On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line - Cai, J - 1994
30	On the length of programs for computing binary sequences - Chaitin - 1966
28	On tables of random numbers - Kolmogorov - 1998
20	A survey of the theory of random sequences - Schnorr - 1977
17	A new interpretation of the von mises’ concept of random sequence. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik - Loveland - 1966
16	Notes on arithmetical models for consistent formulae of the predicate calculus - Kreisel - 1950
16	Algorithmic approach to the prediction problem - Ryabko - 1993
15	Three approaches to the quantitative de of information. Problems of Information Transmission - Kolmogorov - 1965
13	On the sum of digits of real numbers represented in the dyadic systems - Besicovitch - 1934
13	On a randomness criterion - Vovk - 1987
12	A uni approach to the de of random sequences - Schnorr - 1971
11	Process complexity and e�ective random tests� J.Comput - Schnorr
11	The complexity of objects and the development of the concepts of information and randomness by means of the theory of algorithms - Zvonkin, Levin - 1970
8	Noiseless coding of combinatorial sources. Problems of Information Transmission - Ryabko - 1986
6	Dimension und ausseres - Hausdor - 1919
6	On relations between dierent algorithmic de of randomness - Shen - 1989
6	How much can you win when your adversary is handicapped - Staiger - 2000
5	The fractional dimension of a set de by decimal properties - Eggleston - 1949
5	The fractional dimensional theory of continued fractions - Good - 1941
5	Kolmogorov complexity and Hausdor dimension - Staiger - 1993
4	Correspondence principles for eective dimensions - Hitchcock - 2002
3	On the equivalence of in product measures - Kakutani - 1948
3	The complexity and eectiveness of prediction problems - Ryabko - 1994
2	Gales suce for constructive dimension - Hitchcock
2	The Kleene hierarchy classi of recursively random sequences - Loveland - 1966
2	Complexity oscillations in in binary sequences. Zeitschrift fur Wahrscheinlichkeitstheory und Verwandte Gebiete - Martin-Lof - 1971
2	The frequency approach to the de of a random sequence. Semiotika i Informatika - Shen - 1982
2	Von Mises' de of random sequences reconsidered - Lambalgen - 1987