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...
| Главные авторы: | , |
|---|---|
| Формат: | Journal article |
| Опубликовано: |
American Physical Society
2017
|