14 problems
Let be the set of Kolmogorov-random binary strings defined using the fixed universal Turing machine , and let be the threshold supplied by Chaitin's incompleteness theor…
Existence conjecture. There is a highly normal number that is not KL-stochastic.
Let be the space of one-sided infinite sequences over the alphabet , with shift operator . Let be a computable ergodic -invariant measure, and def…
Quantum ShannonfMcMillanfBreiman conjecture. If is an ergodic computable state on and is quantum Martin-Lf random with respect to , then
Let be a computable probability space. Let be computable measure-preserving transformations that commute pairwise. Let be a class with…
Assume that and are computable metric spaces, that is a uniformly computable family of probability measures on…
Let denote nondeterministic automatic complexity. For a random infinite binary sequence, let be the nondeterministic automatic complexity deficiency of its length- p…
Let be a sequence of distinct integers such that the function mapping the unary input to is polynomial-time computable. For a real , write…
A real is polynomially random if it satisfies the polynomial-time randomness notion used in the source, and it is rationally normal if it is normal in every rational base …
Let . A real is Doob random if it satisfies the paper's characterization in terms of computable martingales, and it is e.c.u. random if it…
A real is strongly -random if it is strongly random with parameter , and Hippocrates -energy random if it satisfies the Hippocrates energy-randomness notion wi…
Countability conjecture. There are only countably many id-jump traceable reals.
Let be sets of nonnegative real numbers. The set anticipates when the regular gamblers' wagers from can be evaded against gambler 0's wagers…
Let be a computable limit ordinal, possibly with additional closure properties such as closure under addition. For an oracle , let…