Pages that link to "Item:Q2264549"
From MaRDI portal
The following pages link to Process complexity and effective random tests (Q2264549):
Displaying 25 items.
- Finite state incompressible infinite sequences (Q259039) (← links)
- Strict process machine complexity (Q403400) (← links)
- A linearly computable measure of string complexity (Q441859) (← links)
- Solovay functions and their applications in algorithmic randomness (Q494057) (← links)
- Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs (Q494650) (← links)
- Kobayashi compressibility (Q528498) (← links)
- Universal recursively enumerable sets of strings (Q533863) (← links)
- Program size complexity for possibly infinite computations (Q558440) (← links)
- Algorithmic randomness and monotone complexity on product space (Q627131) (← links)
- Effective category and measure in abstract complexity theory (Q672752) (← links)
- Process and truth-table characterisations of randomness (Q714787) (← links)
- Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets (Q818126) (← links)
- Comparing notions of randomness (Q844892) (← links)
- Relativized Schnorr tests with universal behavior (Q982185) (← links)
- On a definition of random sequences with respect to conditional probability (Q999259) (← links)
- Dimension extractors and optimal decompression (Q1015378) (← 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)
- Epistemic horizons and the foundations of quantum mechanics (Q1735885) (← links)
- A Chaitin \(\Omega\) number based on compressible strings (Q1761717) (← links)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations (Q1885034) (← links)
- Sequential predictions based on algorithmic complexity (Q2581758) (← links)
- Universal Recursively Enumerable Sets of Strings (Q3533008) (← links)
