A variant of the Kolmogorov concept of complexity
From MaRDI portal
Publication:5582801
DOI10.1016/S0019-9958(69)90538-5zbMATH Open0188.52101WikidataQ56814470 ScholiaQ56814470MaRDI QIDQ5582801FDOQ5582801
Authors: Donald W. Loveland 
Publication date: 1969
Published in: Information and Control (Search for Journal in Brave)
Cited In (35)
- Information-theoretic characterizations of recursive infinite strings
- On the inference of optimal descriptions
- Descriptive complexity of computable sequences revisited
- Oracles and Advice as Measurements
- Kolmogorov complexity for possibly infinite computations
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Compressibility and uniform complexity
- \(K\)-triviality in computable metric spaces
- Time-bounded incompressibility of compressible strings and sequences
- Degrees of monotone complexity
- Recursively compressible sets
- Algorithmic complexity of recursive and inductive algorithms
- Strong jump-traceability. I: The computably enumerable case
- Descriptive complexity of computable sequences
- The frequent paucity of trivial strings
- On the relation between descriptional complexity and algorithmic probability
- Complexity of algorithms and computations
- Several results in program size complexity
- On the notion of infinite pseudorandom sequences
- Algorithmic analysis of irrational rotations in a single neuron model
- Philosophical issues in Kolmogorov complexity
- Process complexity and effective random tests
- Calibrating Randomness
- Endliche Automaten und Zufallsfolgen
- Learning recursive functions from approximations
- A test for randomness based on a complexity measure
- Sequential predictions based on algorithmic complexity
- Trivial Reals
- Toward an abstract theory of data compression
- Relations between varieties of kolmogorov complexities
- Minimal-program complexity of pseudo-recursive and pseudo-random sequences
- Kolmogorov complexity and non-determinism
- An unpredictability approach to finite-state randomness
- Comparison between the complexity of a function and the complexity of its graph
- Kobayashi compressibility
This page was built for publication: A variant of the Kolmogorov concept of complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5582801)
