Blum Static Complexity and Encoding Spaces

DOI10.1007/978-3-642-39310-5_1MaRDI QIDQ2843080zbMATH OpenOpenAlexFDO

Authors C. Câmpeanu

Publication date 9 August 2013

Published in Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39310-5_1

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Formal languages and automata (68Q45)

Recommendations

• Descriptional complexity in encoded Blum static complexity spaces
• A note on Blum static complexity measures
• Randomness in Blum universal static complexity spaces
• Randomness behaviour in Blum universal static complexity spaces
• Quantitative coding and complexity theory of compact metric spaces
• On tight separation for Blum measures applied to Turing machine buffer complexity
• Complexity of Dependences in Bounded Domains, Armstrong Codes, and Generalizations
• scientific article; zbMATH DE number 606784
• The Parametrized Complexity of Some Fundamental Problems in Coding Theory
• Using BL-algebras for codes

Cited in

(3)

• A note on Blum static complexity measures
• Blum's and Burgin's axioms, complexity, and randomness
• Descriptional complexity in encoded Blum static complexity spaces

This page was built for publication: Blum Static Complexity and Encoding Spaces

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