A new paper of mine with my colleagues, and Algorithmic Nature Lab members, Nicolas Gauvrit and Fernando Soler-Toscano just came out. Using previously generated and new experimental data together with new methods to calculate the algorithmic complexity of 2-dimensional objects, we were able to find that when humans assess the complexity of an image (a small 4×4 […]

The method introduced in my doctoral dissertation was featured in the French version of Scientific American Pour La Science in its July 2011 issue No. 405 under the title Le défi des faibles complexités. Jean-Paul Delahaye points out that: Comme les très petites durées ou longueurs, les faibles complexités sont délicates à évaluer. Paradoxalement, les [...] <http://feeds.feedburner.com/~ff/AnimaExMachina?a=2d__n0lQMbQ:XUCidLYZUSs:yIl2AUoC8zA><http://feeds.feedburner.com/~ff/AnimaExMachina?a=2d__

Sonificación del Círculo Exterior Inferior del edificio CIRCE de Zaragoza.

Sonificación de la Plaza del Viento del edificio CIRCE de Zaragoza.

Sonificación de la Plaza de la Tierra del edificio CIRCE de Zaragoza.

Sonificación de la Plaza del Fuego del edificio CIRCE de Zaragoza.

Sonificación de la Plaza del Agua del edificio CIRCE de Zaragoza.

Sonificación de la Plaza del Agua del edificio CIRCE de Zaragoza.

In a previous article, I suggested a method for testing the algorithmicity of a natural/physical process using the concept of Levin’s universal distribution. In this new paper published by the Journal of Experimental Artificial Intelligence, I explain this method in the context of the problem formulated by Floridi concerning the testability of pancomputationalism. Then, I introduce a […]