On the Kolmogorov complexity of arbitrary objects
type: Item
instance of: scholarly article
title: On the Kolmogorov complexity of arbitrary objects
zbMATH Open document ID: 0805.68064
author: Aaron Shenhar
published in: Journal of Complexity
publication date: 1994-08-17T00:00:00Z
review text: The paper suggests an interesting topological way to generalize the notion of algorithmic information to arbitrary objects.
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 614378
zbMATH Keywords: Kolmogorov complexity
zbMATH Keywords: recursive topology
zbMATH Keywords: algorithmic information
reviewed by: Cristian S. Calude
MaRDI profile type: Publication
full work available at URL: jcom.1993.1032
OpenAlex ID: W2025096655
DOI: 10.1006/JCOM.1993.1032
description: scientific article; zbMATH DE number 614378