Pages that link to "Item:Q3915691"
From MaRDI portal
The following pages link to Exact Expressions for Some Randomness Tests (Q3915691):
Displayed 22 items.
- The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite (Q285515) (← links)
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points (Q418118) (← links)
- Solovay functions and their applications in algorithmic randomness (Q494057) (← links)
- Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs (Q494650) (← links)
- Pure quantum states are fundamental, mixtures (composite states) are mathematical constructions: An argument using algorithmic information theory (Q678640) (← links)
- Prequential randomness and probability (Q982633) (← links)
- On the relation between descriptional complexity and algorithmic probability (Q1057064) (← links)
- Mathematical metaphysics of randomness (Q1275005) (← links)
- Ergodic theorems for individual random sequences (Q1275009) (← links)
- Energy randomness (Q1617895) (← links)
- Randomness deficiencies (Q2011673) (← links)
- Algorithmic tests and randomness with respect to a class of measures (Q2510759) (← links)
- Uniform test of algorithmic randomness over a general space (Q2566004) (← links)
- The Kučera-Gács theorem revisited by Levin (Q2682931) (← links)
- Computable randomness and betting for computable probability spaces (Q2827949) (← links)
- Kolmogorov complexity and strong approximation of Brownian motion (Q3092856) (← links)
- On initial segment complexity and degrees of randomness (Q3506714) (← links)
- Prequential Randomness (Q3529917) (← links)
- Martin-Löf random quantum states (Q5235513) (← links)
- Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness (Q5250214) (← links)
- DEEP CLASSES (Q5346696) (← links)
- Randomness as an invariant for number representations (Q6142871) (← links)