On the Kolmogorov complexity of arbitrary objects

DOI10.1006/JCOM.1993.1032MaRDI QIDQ1330149zbMATH OpenOpenAlexFDO

Authors Aaron Shenhar

Publication date 17 August 1994

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcom.1993.1032

zbMATH Keywords

algorithmic informationKolmogorov complexityrecursive topology

Mathematics Subject Classification ID

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

Review text

The paper suggests an interesting topological way to generalize the notion of algorithmic information to arbitrary objects.

Cited in

(1)

• Construction of expanders and superconcentrators using Kolmogorov complexity

This page was built for publication: On the Kolmogorov complexity of arbitrary objects

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