Probabilistic automatic complexity of finite strings

MaRDI QIDQ6522711arXivFDO

Authors Kenneth Gill

Published in arXiv

Mathematics Subject Classification ID

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

This page was built for publication: Probabilistic automatic complexity of finite strings

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