Pages that link to "Item:Q5634706"
From MaRDI portal
The following pages link to A unified approach to the definition of random sequences (Q5634706):
Displaying 50 items.
- On stability of probability laws with respect to small violations of algorithmic randomness (Q285512) (← links)
- When does randomness come from randomness? (Q287436) (← links)
- Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers (Q342726) (← links)
- Strict process machine complexity (Q403400) (← links)
- Random sequences with respect to a measure defined by two linear fractional transformations (Q493656) (← links)
- A divergence formula for randomness and dimension (Q616503) (← links)
- A measure-theoretic proof of Turing incomparability (Q638476) (← links)
- Cook versus Karp-Levin: Separating completeness notions if NP is not small (Q671427) (← links)
- Weak completeness in \(\text{E}\) and \(\text{E}_{2}\) (Q673644) (← links)
- How powerful are integer-valued martingales? (Q693070) (← links)
- Process and truth-table characterisations of randomness (Q714787) (← links)
- On fairness and randomness (Q840697) (← links)
- Comparing notions of randomness (Q844892) (← links)
- Randomness and the linear degrees of computability (Q866567) (← links)
- How to gamble against all odds (Q894618) (← links)
- Effective martingales with restricted wagers (Q897654) (← links)
- On the stability property of asymptotic laws of ergodic theory and universal compression schemes (Q906093) (← links)
- Algorithmic randomness of continuous functions (Q926181) (← links)
- Schnorr trivial reals: a construction (Q926182) (← links)
- Gales suffice for constructive dimension (Q1007560) (← links)
- Dimension extractors and optimal decompression (Q1015378) (← links)
- Constructive equivalence relations on computable probability measures (Q1032627) (← links)
- Random sequences of binary digits in which missing values can almost certainly be restored (Q1054343) (← links)
- An unpredictability approach to finite-state randomness (Q1117699) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- Almost everywhere high nonuniform complexity (Q1190985) (← links)
- Randomness, independence, and hypotheses (Q1244552) (← links)
- Objectively homogeneous reference classes (Q1252563) (← links)
- Genericity and randomness over feasible probability measures (Q1275002) (← links)
- Mutual dimension and random sequences (Q1637218) (← links)
- Dimension 1 sequences are close to randoms (Q1680550) (← links)
- Prediction and dimension (Q1780452) (← links)
- Recursive computational depth. (Q1854307) (← links)
- A stronger Kolmogorov zero-one law for resource-bounded measure (Q1870565) (← links)
- Scaled dimension and nonuniform complexity (Q1880776) (← links)
- On Kurtz randomness (Q1885902) (← links)
- The dimensions of individual strings and sequences (Q1887139) (← links)
- Weakly complete problems are not rare (Q1918951) (← links)
- Feasible reductions to Kolmogorov-Loveland stochastic sequences (Q1960665) (← links)
- Modeling parallel transport (Q2101890) (← links)
- Thinking with notations: epistemic actions and epistemic activities in mathematical practice (Q2101897) (← links)
- A Church-Turing thesis for randomness? (Q2117785) (← links)
- Simple betting and stochasticity (Q2117806) (← links)
- The smallest probability interval a sequence is random for: a study for six types of randomness (Q2146046) (← links)
- Granularity of wagers in games and the possibility of saving (Q2216114) (← links)
- Monotonous betting strategies in warped casinos (Q2304524) (← links)
- Unpredictability of complex (pure) strategies (Q2345202) (← links)
- Resource-bounded martingales and computable Dowd-type generic sets (Q2346413) (← links)
- Feasible analysis, randomness, and base invariance (Q2354578) (← links)
- Cryptography and algorithmic randomness (Q2354584) (← links)