Are binary codings universal?

DOI10.1002/CPLX.6130010512MaRDI QIDQ960456zbMATH OpenOpenAlexFDO

Authors Cristian Calcude, C. Câmpeanu

Publication date 21 December 2008

Published in Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/cplx.6130010512

zbMATH Keywords

random sequencesrandom stringsChaitin complexityinstantaneous codes

Mathematics Subject Classification ID

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

Recommendations

• Binary sequences. I: Complexity
• Universal codes of the natural numbers
• scientific article; zbMATH DE number 3326139
• scientific article; zbMATH DE number 3861050
• Any code of which we cannot think is good

Cited in

(2)

• The Kolmogorov complexity of real numbers.
• Universal codes of the natural numbers

This page was built for publication: Are binary codings universal?

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