The following pages link to Calibrating Randomness (Q3412463):
Displaying 46 items.
- Strong jump-traceability. II: \(K\)-triviality (Q375805) (← links)
- Functions that preserve p-randomness (Q393087) (← links)
- Effectively approximating measurable sets by open sets (Q418744) (← links)
- Characterizing the strongly jump-traceable sets via randomness (Q456804) (← links)
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension (Q610681) (← links)
- Extending and interpreting Post's programme (Q636317) (← links)
- Binary subtrees with few labeled paths (Q654001) (← links)
- Randomness and universal machines (Q864423) (← links)
- Undecidability of the structure of the Solovay degrees of c.e. reals (Q881596) (← links)
- Schnorr trivial reals: a construction (Q926182) (← links)
- Does truth-table of linear norm reduce the one-query tautologies to a random oracle? (Q948913) (← links)
- The upward closure of a perfect thin class (Q958485) (← links)
- Algorithmically independent sequences (Q964004) (← links)
- Turing degrees of reals of positive effective packing dimension (Q975475) (← links)
- Optimal redundancy in computations from random oracles (Q1678164) (← links)
- Martin-Löf random generalized Poisson processes (Q1694809) (← links)
- Time-universal data compression (Q2004897) (← links)
- A universal pair of 1/2-betting strategies (Q2051766) (← links)
- Randomness? What randomness? (Q2177748) (← links)
- Unpredictability of complex (pure) strategies (Q2345202) (← links)
- Resource-bounded martingales and computable Dowd-type generic sets (Q2346413) (← links)
- Expected utility theory from the frequentist perspective (Q2376998) (← links)
- Strong jump-traceability. I: The computably enumerable case (Q2474313) (← links)
- Lowness properties and randomness (Q2570074) (← links)
- Kolmogorov-Loveland randomness and stochasticity (Q2576945) (← links)
- Bounded Randomness (Q2891302) (← links)
- Randomness, Computation and Mathematics (Q2904405) (← links)
- Some Questions in Computable Mathematics (Q2973717) (← links)
- A minimal pair of 𝐾-degrees (Q3372137) (← links)
- Algorithmically Independent Sequences (Q3533009) (← links)
- Effective packing dimension of $\Pi ^0_1$-classes (Q3533884) (← links)
- Schnorr trivial sets and truth-table reducibility (Q3570160) (← links)
- RECOGNIZING STRONG RANDOM REALS (Q3580658) (← links)
- Hyperimmune-free degrees and Schnorr triviality (Q3617375) (← links)
- Low upper bounds of ideals (Q3630577) (← links)
- Lowness for Kurtz randomness (Q3630585) (← links)
- Promptness does not imply superlow cuppability (Q3655255) (← links)
- The strength of the rainbow Ramsey Theorem (Q3655258) (← links)
- Schnorr triviality and genericity (Q5190195) (← links)
- The importance of Π<sub>1</sub><sup>0</sup> classes in effective randomness (Q5190208) (← links)
- Turing incomparability in Scott sets (Q5308142) (← links)
- Inherent enumerability of strong jump-traceability (Q5496646) (← links)
- MARTIN-LÖF RANDOMNESS IN SPACES OF CLOSED SETS (Q5501762) (← links)
- A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals (Q5695769) (← links)
- An introduction to Kolmogorov complexity and its applications (Q5915950) (← links)
- A Pseudo-Random Generator Whose Output is a Normal Sequence (Q6114852) (← links)
