3 code implementations • 1 Sep 2016 • Hector Zenil, Santiago Hernández-Orozco, Narsis A. Kiani, Fernando Soler-Toscano, Antonio Rueda-Toicen
We also test the measure on larger objects including dual, isomorphic and cospectral graphs for which we know that algorithmic randomness is low.
Information Theory Computational Complexity Information Theory H.1.1
no code implementations • 14 Sep 2015 • Nicolas Gauvrit, Fernando Soler-Toscano, Hector Zenil
Humans are sensitive to complexity and regularity in patterns.