A note on Blum static complexity measures

DOI10.1007/978-3-642-27654-5_6MaRDI QIDQ2891303zbMATH OpenOpenAlexFDO

Authors C. Câmpeanu

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

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Blum's and Burgin's axioms, complexity, and randomness
• Blum Static Complexity and Encoding Spaces
• Randomness behaviour in Blum universal static complexity spaces
• Randomness in Blum universal static complexity spaces
• Measuring static complexity

Cites work

• A formal theory of inductive inference. Part I
• A formal theory of inductive inference. Part II
• A Machine-Independent Theory of the Complexity of Recursive Functions
• A Theory of Program Size Formally Identical to Information Theory
• Algorithmic complexity as a criterion of unsolvability
• Algorithmic complexity of recursive and inductive algorithms
• Algorithmic Information Theory
• Combinatorial foundations of information theory and the calculus of probabilities
• Complexity-based induction systems: Comparisons and convergence theorems
• HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• scientific article; zbMATH DE number 3492569 (Why is no real title available?)
• scientific article; zbMATH DE number 736618 (Why is no real title available?)
• On minimal-program complexity measures
• On the Length of Programs for Computing Finite Binary Sequences
• On the Length of Programs for Computing Finite Binary Sequences
• On the size of machines
• Process complexity and effective random tests
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• Theories of computational complexity

Cited in

(8)

• Blum Static Complexity and Encoding Spaces
• Blum's and Burgin's axioms, complexity, and randomness
• Randomness behaviour in Blum universal static complexity spaces
• scientific article; zbMATH DE number 3902028 (Why is no real title available?)
• On tight separation for Blum measures applied to Turing machine buffer complexity
• scientific article; zbMATH DE number 1870510 (Why is no real title available?)
• Descriptional complexity in encoded Blum static complexity spaces
• Randomness in Blum universal static complexity spaces

This page was built for publication: A note on Blum static complexity measures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891303)