85 citations · 742 across the 80 of their papers we have counts for
Showing 2016 · cs.ITShow all
2 papers · 2 filters
cs.IT2016
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity
Hector Zenil, Santiago Hernández-Orozco, Narsis A. Kiani +2
We investigate the properties of a Block Decomposition Method (BDM), which extends the power of a Coding Theorem Method (CTM) that approximates local estimations of algorithmic com…
cs.IT2016★ 85 cited
Low Algorithmic Complexity Entropy-deceiving Graphs
Hector Zenil, Narsis Kiani, Jesper Tegnér
In estimating the complexity of objects, in particular of graphs, it is common practice to rely on graph- and information-theoretic measures. Here, using integer sequences with pro…