Pages that link to "Item:Q5582801"
From MaRDI portal
The following pages link to A variant of the Kolmogorov concept of complexity (Q5582801):
Displaying 35 items.
- Compressibility and uniform complexity (Q287086) (← links)
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
- Kobayashi compressibility (Q528498) (← links)
- Toward an abstract theory of data compression (Q794162) (← links)
- Time-bounded incompressibility of compressible strings and sequences (Q989573) (← links)
- On the relation between descriptional complexity and algorithmic probability (Q1057064) (← links)
- On the notion of infinite pseudorandom sequences (Q1091817) (← links)
- An unpredictability approach to finite-state randomness (Q1117699) (← links)
- Several results in program size complexity (Q1152214) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- Information-theoretic characterizations of recursive infinite strings (Q1226484) (← links)
- On the inference of optimal descriptions (Q1245956) (← links)
- Recursively compressible sets (Q1282502) (← links)
- Learning recursive functions from approximations (Q1370868) (← links)
- Algorithmic complexity of recursive and inductive algorithms (Q1434367) (← links)
- Kolmogorov complexity for possibly infinite computations (Q1777368) (← links)
- Algorithmic analysis of irrational rotations in a single neuron model (Q1869962) (← links)
- The frequent paucity of trivial strings (Q2252648) (← links)
- Process complexity and effective random tests (Q2264549) (← links)
- Descriptive complexity of computable sequences revisited (Q2290652) (← links)
- Strong jump-traceability. I: The computably enumerable case (Q2474313) (← links)
- Endliche Automaten und Zufallsfolgen (Q2553152) (← links)
- Sequential predictions based on algorithmic complexity (Q2581758) (← links)
- \(K\)-triviality in computable metric spaces (Q2839373) (← links)
- Calibrating Randomness (Q3412463) (← links)
- Degrees of monotone complexity (Q3416117) (← links)
- Oracles and Advice as Measurements (Q3543332) (← links)
- Minimal-program complexity of pseudo-recursive and pseudo-random sequences (Q4065032) (← links)
- A test for randomness based on a complexity measure (Q4275809) (← links)
- Relations between varieties of kolmogorov complexities (Q4879210) (← links)
- Trivial Reals (Q4916182) (← links)
- Philosophical issues in Kolmogorov complexity (Q5204301) (← links)
- Comparison between the complexity of a function and the complexity of its graph (Q5958280) (← links)
- Descriptive complexity of computable sequences (Q5958281) (← links)
- Kolmogorov complexity and non-determinism (Q5958289) (← links)
