Results 1  10
of
10
The Dimensions of Individual Strings and Sequences
 INFORMATION AND COMPUTATION
, 2003
"... 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 ..."
Abstract

Cited by 94 (10 self)
 Add to MetaCart
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
Scaled dimension and nonuniform complexity
 Journal of Computer and System Sciences
, 2004
"... Resourcebounded dimension is a complexitytheoretic extension of classical Hausdorff dimension introduced by Lutz (2000) in order to investigate the fractal structure of sets that have resourcebounded measure 0. For example, while it has long been known that the Boolean circuitsize complexity cla ..."
Abstract

Cited by 27 (12 self)
 Add to MetaCart
Resourcebounded dimension is a complexitytheoretic extension of classical Hausdorff dimension introduced by Lutz (2000) in order to investigate the fractal structure of sets that have resourcebounded measure 0. For example, while it has long been known that the Boolean circuitsize complexity class SIZE � α 2n n has measure 0 in ESPACE for all 0 ≤ α ≤ 1, we now know that SIZE � α 2n n has dimension α in ESPACE for all 0 ≤ α ≤ 1. The present paper furthers this program by developing a natural hierarchy of “rescaled” resourcebounded dimensions. For each integer i and each set X of decision problems, we define the ithorder dimension of X in suitable complexity classes. The 0thorder dimension is precisely the dimension of Hausdorff (1919) and Lutz (2000). Higher and lower orders are useful for various sets X. For example, we prove the following for 0 ≤ α ≤ 1 and any polynomial q(n) ≥ n2. 1. The class SIZE(2 αn) and the time and spacebounded Kolmogorov complexity classes KT q (2 αn) and KS q (2 αn) have 1 storder dimension α in ESPACE. 2. The classes SIZE(2nα), KT q (2nα), and KS q (2nα) have 2ndorder dimension α in ESPACE.
Some ComputabilityTheoretical Aspects of Reals and Randomness
 the Lect. Notes Log. 18, Assoc. for Symbol. Logic
, 2001
"... We study computably enumerable reals (i.e. their left cut is computably enumerable) in terms of their spectra of representations and presentations. ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
We study computably enumerable reals (i.e. their left cut is computably enumerable) in terms of their spectra of representations and presentations.
Gales suffice for constructive dimension
 Information Processing Letters
, 2003
"... Supergales, generalizations of supermartingales, have been used by Lutz (2002) to define the constructive dimensions of individual binary sequences. Here it is shown that gales, the corresponding generalizations of martingales, can be equivalently used to define constructive dimension. 1 ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
Supergales, generalizations of supermartingales, have been used by Lutz (2002) to define the constructive dimensions of individual binary sequences. Here it is shown that gales, the corresponding generalizations of martingales, can be equivalently used to define constructive dimension. 1
Prediction and Dimension
 Journal of Computer and System Sciences
, 2002
"... Given a set X of sequences over a nite alphabet, we investigate the following three quantities. (i) The feasible predictability of X is the highest success ratio that a polynomialtime randomized predictor can achieve on all sequences in X. ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
Given a set X of sequences over a nite alphabet, we investigate the following three quantities. (i) The feasible predictability of X is the highest success ratio that a polynomialtime randomized predictor can achieve on all sequences in X.
On the Autoreducibility of Random Sequences
, 2001
"... A binary sequence A = A(0)A(1) ... is called i.o. Turingautoreducible if A is reducible to itself via an oracle Turing machine that never queries its oracle at the current input, outputs either A(x) or a don'tknow symbol on any given input x, and outputs A(x) for infinitely many x. If in addition ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
A binary sequence A = A(0)A(1) ... is called i.o. Turingautoreducible if A is reducible to itself via an oracle Turing machine that never queries its oracle at the current input, outputs either A(x) or a don'tknow symbol on any given input x, and outputs A(x) for infinitely many x. If in addition the oracle Turing machine terminates on all inputs and oracles, A is called i.o. truthtableautoreducible.
On the construction of effective random sets
 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002, LECTURE NOTES IN COMPUTER SCIENCE
, 2002
"... We give a direct and rather simple construction of MartinLöf random and recrandom sets with certain additional properties. First, reviewing the result of Gacs and Kucera, given any set X we construct a MartinLöf random set R from which X can be decoded effectively. Second, by essentially the same ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We give a direct and rather simple construction of MartinLöf random and recrandom sets with certain additional properties. First, reviewing the result of Gacs and Kucera, given any set X we construct a MartinLöf random set R from which X can be decoded effectively. Second, by essentially the same construction we obtain a MartinLöf random set R that is computably enumerable selfreducible. Alternatively, using the observation that a set is computably enumerable selfreducible if and only if its associated real is computably enumerable, the existence of such a set R follows from the known fact that every Chaitin real is MartinLöf random and computably enumerable. Third, by a variant of the basic construction we obtain a recrandom set that is weak truthtable autoreducible. The mentioned results on self and autoreducibility complement work of Ebert, Merkle, and Vollmer [79], from which it follows that no MartinLöf random set is Turingautoreducible and that no recrandom set is truthtable autoreducible.
Why Computational Complexity Requires Stricter Martingales
"... The word "martingale " has related, but different, meanings in probability theory and theoretical computer science. In computational complexity and algorithmic information theory, a martingale is typically a function d on strings such that E(d(wb)w) = d(w) for all strings w, where the c ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The word "martingale " has related, but different, meanings in probability theory and theoretical computer science. In computational complexity and algorithmic information theory, a martingale is typically a function d on strings such that E(d(wb)w) = d(w) for all strings w, where the conditional expectation is computed over all possible values of the next symbol b. In modern probability theory a martingale is typically a sequence,0,,1,,2,... of random variables such that E(,n+1,0,...,,n) =,n for all n.
AverageCase Complexity Theory and PolynomialTime Reductions
, 2001
"... This thesis studies averagecase complexity theory and polynomialtime reducibilities. The issues in averagecase complexity arise primarily from Cai and Selman's extension of Levin's denition of average polynomial time. We study polynomialtime reductions between distributional problems. Under stro ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This thesis studies averagecase complexity theory and polynomialtime reducibilities. The issues in averagecase complexity arise primarily from Cai and Selman's extension of Levin's denition of average polynomial time. We study polynomialtime reductions between distributional problems. Under strong but reasonable hypotheses we separate ordinary NPcompleteness notions.
Fairness, Computable Fairness, and Randomness
"... Motivated by the observation that executions of a probabilistic system almost surely are fair, we interpret concepts of fairness for nondeterministic processes as partial descriptions of probabilistic behavior. We propose computable fairness as a very strong concept of fairness, attempting to captur ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Motivated by the observation that executions of a probabilistic system almost surely are fair, we interpret concepts of fairness for nondeterministic processes as partial descriptions of probabilistic behavior. We propose computable fairness as a very strong concept of fairness, attempting to capture all the qualitative properties of probabilistic behavior that we might reasonably expect to see in the behavior of a nondeterministic system. It is shown that computable fairness does describe probabilistic behavior by proving that runs of a probabilistic system almost surely are computable fair. We then turn to the question of how sharp an approximation of randomness is obtained by computable fairness by discussing completeness of computable fairness for certain classes of path properties.