45 problems
- 0 votes0 replies0 views
Kolmogorov-random-string consistency proof-size conjecture
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…
- 0 votes0 replies0 views
Generalized Limit Theorem for S2a-reducibility on c.a. reals
Let and be c.a. reals, where is Solovay reducible to in the S2a sense, denoted . Generalized Limit Theore…
- 0 votes0 replies0 views
Existence of a highly normal number that is not KL-stochastic
Existence conjecture. There is a highly normal number that is not KL-stochastic.
- 0 votes0 replies1 view
The characterization of randomness for shift-invariant measures
Shift-invariant randomness question. What properties of a finite sequence of heads and tails make us reject the conjecture that it was generated by some shift-invariant random proc…
- 0 votes0 replies2 views
Conjecture that the decimal expansion of pi is Borel normal
A real number is Borel normal in base 10 when each possible finite string of decimal digits occurs in its expansion with the limiting frequency expected for independent uniformly d…
- 0 votes0 replies0 views
Randomness-extractor conjecture for biased normal and Bernoulli-random reals
Randomness-extractor conjecture. There is a generalization of von Neumann's randomness extractor which computes normal reals from biased normal reals and -Martin-Löf rando…
- 0 votes0 replies0 views
The conjecture that Kolmogorov-Loveland randomness equals Martin-Löf randomness
Kolmogorov-Loveland randomness conjecture. The Kolmogorov-Loveland random sequences are precisely the Martin-Löf random sequences.
- 0 votes0 replies0 views
Day–Marks conjecture on simultaneous continuous randomness
Let . They are simultaneously continuously random if there exist a real and a measure such that computes and both and are…
- 0 votes0 replies0 views
Effective SMB theorem for measures
Let be the space of one-sided infinite sequences over the alphabet , with shift operator . Let be a computable ergodic -invariant measure, and def…
- 0 votes0 replies0 views
Failure of equivalence between Solovay test notions for measures
A Solovay test for a measure is a sequence of effectively open sets satisfying the usual Solovay-test bound, while a strong Solovay test additionally requires each component to be…
- 0 votes0 replies0 views
The conjecture that randomness questions arise naturally in constructive measure-theoretic settings
The discussion concerns constructive measure theory, measurable locales, forcing, and categorical frameworks such as sheaves, toposes, and type theory, in which randomness can be f…
- 0 votes0 replies0 views
The principle of typicality forms quantum mechanics
The principle of typicality is a postulate in the many-worlds interpretation, and Postulates … , and … , … forms quantum mechanics. The paper presents this as a unifying conjecture…
- 0 votes0 replies0 views
Quantum Shannon–McMillan–Breiman conjecture for quantum Martin-Löf random states
Quantum ShannonfMcMillanfBreiman conjecture. If is an ergodic computable state on and is quantum Martin-Lf random with respect to , then
- 0 votes0 replies1 view
Downward-closed covering implies infinite-often subuniformity
Downward-closed covering conjecture. For closed downwards under Turing reducibility, the implication
- 0 votes0 replies2 views
The low-for-a9 characterization of degrees speeding up Omega
Let be a function satisfying, for every constant , the existence of an such that … A degree is low for if it computes a set relative to which is random…
- 0 votes0 replies0 views
The arithmetical complexity of the ideal of -bases
A set is a -base if and only if, for some (equivalently, any) effective measure-preserving isomorphism , ther…
- 0 votes0 replies1 view
The integral characterization of Schnorr randomness for effectively compact measure classes
Schnorr -test conjecture. The appropriate test for Schnorr -randomness is a lower semicomputable function such that the map
- 0 votes0 replies0 views
No least uniform-computability degree for Schnorr-neutral measures
Schnorr-neutrality degree conjecture. A result analogous to the theorem that each weakly neutral measure has no least Turing degree computing it should hold for Schnorr randomness,…
- 0 votes0 replies0 views
Schnorr-Fuchs randomness agrees with uniform Schnorr randomness for Bernoulli measures
Schnorr-Fuchs equivalence conjecture. For a large class of measures, including Bernoulli measures, Schnorr-Fuchs randomness agrees with the paper's definition of Schnorr randomness…
- 0 votes0 replies0 views
Uniform computability as the reducibility induced by uniform Schnorr randomness
Uniform-computability conjecture. The converse to the implication that uniform computation preserves uniform Schnorr randomness should hold: whenever, for all appropriate measures…
- 0 votes0 replies0 views
The putative full multiple recurrence theorem for computable probability spaces
Multiple recurrence conjecture. If is ML-random, then there exists such that
- 0 votes0 replies0 views
Takahashi's characterization conjecture for randomness in conditional measures
Let be a computable measure on , let be its first marginal, and let denote the associated conditional m…
- 0 votes0 replies0 views
Multiple recurrence conjecture for computable commuting transformations
Let be a computable probability space. Let be computable measure-preserving transformations that commute pairwise. Let be a class with…
- 0 votes0 replies0 views
The optimal oracle-use conjecture for computing c.e. reals from Chaitin omega numbers
Let be a computable non-decreasing function satisfying … A real is computable with use from an oracle if the computation of its first bits queries only the first…
- 0 votes0 replies0 views
Uniform relativization conjecture for computable randomness under layerwise maps
Assume that and are computable metric spaces, that is a uniformly computable family of probability measures on…