75 citations · 93 across the 8 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2024★ 1 cited
Simplicity bias, algorithmic probability, and the random logistic map
Boumediene Hamzi, Kamaludin Dingle
Simplicity bias is an intriguing phenomenon prevalent in various input-output maps, characterized by a preference for simpler, more regular, or symmetric outputs. Notably, these ma…
cs.IT2013★ 75 cited
Correlation of Automorphism Group Size and Topological Properties with Program-size Complexity Evaluations of Graphs and Complex Networks
Hector Zenil, Fernando Soler-Toscano, Kamaludin Dingle +1
We show that numerical approximations of Kolmogorov complexity (K) applied to graph adjacency matrices capture some group-theoretic and topological properties of graphs and empiric…