The following pages link to (Q4070738):
Displaying 50 items.
- The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite (Q285515) (← links)
- Random sequences with respect to a measure defined by two linear fractional transformations (Q493656) (← links)
- Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs (Q494650) (← links)
- Program size complexity for possibly infinite computations (Q558440) (← links)
- A natural encoding scheme proved probabilistic polynomial complete (Q593778) (← links)
- Algorithmic randomness and monotone complexity on product space (Q627131) (← links)
- On empirical meaning of randomness with respect to parametric families of probability distributions (Q692926) (← links)
- Process and truth-table characterisations of randomness (Q714787) (← links)
- Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets (Q818126) (← links)
- On generalized computable universal priors and their convergence (Q860822) (← links)
- Algorithmic randomness of continuous functions (Q926181) (← links)
- Leading strategies in competitive on-line prediction (Q950203) (← links)
- Prequential randomness and probability (Q982633) (← links)
- On a definition of random sequences with respect to conditional probability (Q999259) (← links)
- Scaled dimension and the Kolmogorov complexity of Turing-hard sets (Q1015370) (← links)
- On the relation between descriptional complexity and algorithmic probability (Q1057064) (← links)
- Random sequence generation by cellular automata (Q1082817) (← links)
- On the notion of infinite pseudorandom sequences (Q1091817) (← links)
- An improved zero-one law for algorithmically random sequences (Q1127324) (← links)
- On independent random oracles (Q1185000) (← links)
- Inductive reasoning and Kolmogorov complexity (Q1190991) (← links)
- On the inference of optimal descriptions (Q1245956) (← links)
- Mathematical metaphysics of randomness (Q1275005) (← links)
- Ergodic theorems for individual random sequences (Q1275009) (← links)
- Computational depth and reducibility (Q1334655) (← links)
- On collapsing the polynomial-time hierarchy (Q1339382) (← links)
- The discovery of algorithmic probability (Q1370859) (← links)
- Algorithmic complexity of recursive and inductive algorithms (Q1434367) (← links)
- Dimension 1 sequences are close to randoms (Q1680550) (← links)
- A generalized characterization of algorithmic probability (Q1694008) (← links)
- An algorithmic look at financial volatility (Q1712041) (← links)
- Epistemic horizons and the foundations of quantum mechanics (Q1735885) (← links)
- Equidistribution, uniform distribution: a probabilist's perspective (Q1746512) (← links)
- Recursive computational depth. (Q1854307) (← links)
- Randomness and reducibility (Q1878680) (← links)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations (Q1885034) (← links)
- On Kurtz randomness (Q1885902) (← links)
- The dimensions of individual strings and sequences (Q1887139) (← links)
- The Kolmogorov complexity of random reals (Q1887661) (← links)
- Feasible reductions to Kolmogorov-Loveland stochastic sequences (Q1960665) (← links)
- Randomness deficiencies (Q2011673) (← links)
- Randomness is inherently imprecise (Q2069032) (← links)
- Thinking with notations: epistemic actions and epistemic activities in mathematical practice (Q2101897) (← links)
- On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness (Q2105577) (← links)
- On the computational power of random strings (Q2271990) (← links)
- On semimeasures predicting Martin-Löf random sequences (Q2381581) (← links)
- On effectively closed sets of effective strong measure zero (Q2453070) (← links)
- Random reals à la Chaitin with or without prefix-freeness (Q2456371) (← links)
- Uniform test of algorithmic randomness over a general space (Q2566004) (← links)
- Sequential predictions based on algorithmic complexity (Q2581758) (← links)
