【24h】

Two Problems for Sophistication

机译:复杂的两个问题

获取原文

摘要

Kolmogorov complexity measures the amount of information in data, but does not distinguish structure from noise. Kolmogorov's definition of the structure function was the first attempt to measure only the structural information in data, by measuring the complexity of the smallest model that allows for optimal compression of the data. Since then, many variations of this idea have been proposed, for which we use sophistication as an umbrella term. We describe two fundamental problems with existing proposals, showing many of them to be unsound. Consequently, we put forward the view that the problem is fundamental: it may be impossible to objectively quantify the sophistication.
机译:Kolmogorov复杂性测量数据中的信息量,但不会区分结构免于噪声。 Kolmogorov对结构功能的定义是首次尝试仅测量数据中的结构信息,通过测量允许最佳压缩数据的最小模型的复杂性。从那时起,已经提出了这种想法的许多变化,我们将复杂性与伞术语一起使用。我们描述了现有提案的两个基本问题,展示了许多人不健全。因此,我们提出了这个问题是基础的观点:可能是不可能客观地量化复杂性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号