activity
20062013
most citedOn Logical Depth and the Running Time of Shortest Programs

2 citations · 4 across the 6 of their papers we have counts for

collaborators

6 papers

cs.CC2013★ 2 cited

On Logical Depth and the Running Time of Shortest Programs

L. Antunes, A. Souto, P. M. B. Vitanyi

The logical depth with significance of a finite binary string is the shortest running time of a binary program for that can be compressed by at most bits. There is…

cs.IT2013★ 1 cited

Sophistication vs Logical Depth

Luís Antunes, Bruno Bauwens, Andre Souto +1

Sophistication and logical depth are two measures that express how complicated the structure in a string is. Sophistication is defined as the minimal complexity of a computable fun…

cs.CC2013

On the logical depth function

L. Antunes, A. Souto, A. Teixeira +1

For a finite binary string its logical depth for significance is the shortest running time of a program for of length . There is another definition of logic…

cs.IT2009★ 1 cited

Entropy Measures vs. Algorithmic Information

Andreia Teixeira, Andre Souto, Armando Matos +1

Algorithmic entropy and Shannon entropy are two conceptually different information measures, as the former is based on size of programs and the later in probability distributions.…

cs.CC2008

Depth as Randomness Deficiency

Luis Antunes, Armando Matos, Andre Souto +1

Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an uncondition…

q-bio.TO2006

Clustering fetal heart rate tracings by compression

C. Costa Santos, J. Bernardes, P. Vitanyi +1

Fetal heart rate (FHR) monitoring, before and during labor, is a very important medical practice in the detection of fetuses in danger. We clustered FHR tracings by compression in…