Automatic complexity. A computable measure of irregularity

DOI10.1515/9783110774870MaRDI QIDQ6063553zbMATH OpenOpenAlexFDO

Authors Bjørn Kjos-Hanssen

Publication date 7 November 2023

Published in De Gruyter Series in Logic and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/9783110774870

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of computing (68Qxx)

Recommendations

• scientific article; zbMATH DE number 1747450
• scientific article; zbMATH DE number 107774
• Kolmogorov Complexity and Algorithmic Randomness
• Methods and applications of algorithmic complexity. Beyond statistical lossless compression
• Automatic Kolmogorov complexity and normality revisited

Cited in

(2)

• Concatenative nonmonotonicity and optimal links in HP protein folding models
• Languages of words of low automatic complexity are hard to compute

This page was built for publication: Automatic complexity. A computable measure of irregularity

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