Low algorithmic complexity entropy-deceiving graphs
A common practice in the estimation of the complexity of objects, in particular of graphs, is to rely on graph- and information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these measures are not independent of the way in which a single ob...
Main Authors: | Zenil, H, Kiani, N |
---|---|
Format: | Journal article |
Published: |
American Physical Society
2017
|
Similar Items
-
Deceived /
by: Barrett, Maria
Published: (1994) -
The deceived /
by: 219277 Battles, Brett
Published: (2008) -
The deceiver /
by: Forsyth, Frederick, 1938-
Published: (1992) -
Deceiving People
by: Tarik Jan
Published: (2011-01-01) -
A decomposition method for global evaluation of shannon entropy and local estimations of algorithmic complexity
by: Zenil, H, et al.
Published: (2016)