A Note on Blum Static Complexity Measures
From MaRDI portal
Publication:2891303
DOI10.1007/978-3-642-27654-5_6zbMath1353.68142OpenAlexW150741891MaRDI QIDQ2891303
Publication date: 15 June 2012
Published in: Computation, Physics and Beyond (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-27654-5_6
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theories of computational complexity
- Algorithmic complexity of recursive and inductive algorithms
- Process complexity and effective random tests
- Algorithmic complexity as a criterion of unsolvability
- HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
- Combinatorial foundations of information theory and the calculus of probabilities
- Algorithmic Information Theory
- A Theory of Program Size Formally Identical to Information Theory
- Complexity-based induction systems: Comparisons and convergence theorems
- On minimal-program complexity measures
- A Machine-Independent Theory of the Complexity of Recursive Functions
- On the Length of Programs for Computing Finite Binary Sequences
- On the size of machines
- On the Length of Programs for Computing Finite Binary Sequences
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- A formal theory of inductive inference. Part I
- A formal theory of inductive inference. Part II
This page was built for publication: A Note on Blum Static Complexity Measures
