Pages that link to "Item:Q2264549"
From MaRDI portal
The following pages link to Process complexity and effective random tests (Q2264549):
Displaying 50 items.
- Finite state incompressible infinite sequences (Q259039) (← links)
- The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite (Q285515) (← links)
- Relative to a random oracle, P/poly is not measurable in EXP (Q294619) (← 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)
- Cook versus Karp-Levin: Separating completeness notions if NP is not small (Q671427) (← links)
- Effective category and measure in abstract complexity theory (Q672752) (← links)
- Weak completeness in \(\text{E}\) and \(\text{E}_{2}\) (Q673644) (← 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)
- On the relation between descriptional complexity and algorithmic probability (Q1057064) (← 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)
- Almost everywhere high nonuniform complexity (Q1190985) (← links)
- Information-theoretic characterizations of recursive infinite strings (Q1226484) (← links)
- Toward a mathematical theory of graph-generative systems and its applications (Q1237578) (← links)
- On the inference of optimal descriptions (Q1245956) (← links)
- On the size of classes with weak membership properties (Q1274925) (← links)
- Genericity and randomness over feasible probability measures (Q1275002) (← links)
- Mathematical metaphysics of randomness (Q1275005) (← links)
- Ergodic theorems for individual random sequences (Q1275009) (← links)
- Identifying randomness given by high descriptive complexity (Q1325197) (← 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)
- Epistemic horizons and the foundations of quantum mechanics (Q1735885) (← links)
- A Chaitin \(\Omega\) number based on compressible strings (Q1761717) (← links)
- Recursive computational depth. (Q1854307) (← links)
- A stronger Kolmogorov zero-one law for resource-bounded measure (Q1870565) (← links)
- Randomness and reducibility (Q1878680) (← links)
- Scaled dimension and nonuniform complexity (Q1880776) (← links)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations (Q1885034) (← links)
- The dimensions of individual strings and sequences (Q1887139) (← links)
- Weakly complete problems are not rare (Q1918951) (← links)
- Time-bounded Kolmogorov complexity and Solovay functions (Q1946499) (← links)
- Feasible reductions to Kolmogorov-Loveland stochastic sequences (Q1960665) (← links)
