23 citations · 50 across the 18 of their papers we have counts for
5 papers · 1 filter
Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method
Eduardo Yuji Sakabe, Felipe S. Abrahão, Santiago Hernández-Orozco +2
The Block Decomposition Method (BDM) was introduced as an alternative to popular lossless compression methods such as LZW for estimating algorithmic complexity from the principles…
Algorithmic Information Dynamics of Cellular Automata
Hector Zenil, Alyssa Adams
We illustrate an application of Algorithmic Information Dynamics to Cellular Automata (CA) demonstrating how this digital calculus is able to quantify change in discrete dynamical…
An Algorithmic Information Distortion in Multidimensional Networks
Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil +1
Network complexity, network information content analysis, and lossless compressibility of graph representations have been played an important role in network analysis and network m…
A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions
Hector Zenil
Some established and also novel techniques in the field of applications of algorithmic (Kolmogorov) complexity currently co-exist for the first time and are here reviewed, ranging…
The Thermodynamics of Network Coding, and an Algorithmic Refinement of the Principle of Maximum Entropy
Hector Zenil, Narsis A. Kiani, Jesper Tegnér
The principle of maximum entropy (Maxent) is often used to obtain prior probability distributions as a method to obtain a Gibbs measure under some restriction giving the probabilit…