Randomness in Blum universal static complexity spaces

DOI10.25596/JALC-2012-107MaRDI QIDQ5178450zbMATH OpenFDO

Authors C. Câmpeanu

Publication date 16 March 2015

Full work available at URL https://doi.org/10.25596/JALC-2012-107

zbMATH Keywords

Chaitin complexitydescriptional complexitydual complexity measuresKolmogorov complexityrandomness

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Randomness behaviour in Blum universal static complexity spaces
• Blum's and Burgin's axioms, complexity, and randomness
• scientific article; zbMATH DE number 1223737
• A note on Blum static complexity measures
• The complexity of the set of nonrandom numbers

Cited in

(5)

• Blum Static Complexity and Encoding Spaces
• A note on Blum static complexity measures
• JSL volume 79 issue 2 Cover and Front matter
• Blum's and Burgin's axioms, complexity, and randomness
• Randomness behaviour in Blum universal static complexity spaces

This page was built for publication: Randomness in Blum universal static complexity spaces

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