The extent and density of sequences within the minimal-program complexity hierarchies
From MaRDI portal
Publication:1212360
DOI10.1016/S0022-0000(74)80004-8zbMath0293.68044MaRDI QIDQ1212360
Publication date: 1974
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
Related Items
On Oscillation-free ε-random Sequences, Research in the theory of inductive inference by GDR mathematicians - A survey, On the inference of optimal descriptions, The Kolmogorov complexity of real numbers., The Kolmogorov complexity of infinite words, On partial randomness, Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension
Cites Work
- Optimal enumerations and optimal gödel numberings
- Minimal-program complexity of sequences with restricted resources
- An Example of Information and Computation Resource Trade-Off
- On minimal-program complexity measures
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item