On minimal-program complexity measures
From MaRDI portal
Publication:5402506
DOI10.1145/800169.805422zbMath1282.68146OpenAlexW2085538865MaRDI QIDQ5402506
Publication date: 14 March 2014
Published in: Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/800169.805422
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Computability and recursion theory (03D99)
Related Items (5)
A Note on Blum Static Complexity Measures ⋮ A unified approach to the definition of random sequences ⋮ Minimal-program complexity of pseudo-recursive and pseudo-random sequences ⋮ The extent and density of sequences within the minimal-program complexity hierarchies ⋮ Sequential predictions based on algorithmic complexity
This page was built for publication: On minimal-program complexity measures
