Robustness of logical depth

Authors:
Luís Antunes;Andre Souto;Andreia Teixeira
Affiliations:
Departamento de Ciência de Computadores, Universidade do Porto, Porto, Portugal;Instituto de Telecomunicações, Instituto Superior Técnico, Universidade Técnica de Lisboa, Lisboa, Portugal;Departamento de Ciência de Computadores, Universidade do Porto, Porto, Portugal
Venue:
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Year:
2012

Citing 9
Cited 0

Logical depth and physical complexity

A half-century survey on The Universal Turing Machine
Structure

The universal Turing machine (2nd ed.)
Information measures, effective complexity, and total information

Complexity
On the Length of Programs for Computing Finite Binary Sequences

Journal of the ACM (JACM)
Computational depth: concept and applications

Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Using self-dissimilarity to quantify complexity: Research Articles

Complexity
An Introduction to Kolmogorov Complexity and Its Applications

An Introduction to Kolmogorov Complexity and Its Applications
Sophistication Revisited

Theory of Computing Systems
Meaningful Information

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Usually one can quantify the subjective notion of useful information in two different perspectives: static resources --- measuring the amount of planing required to construct the object; or dynamic resources --- measuring the computational effort required to produce the object. We study the robustness of logical depth measuring dynamic resources, proving that small variations in the significance level can cause large changes in the logical depth.