We have made available a basic beta version of an Online Algorithmic Complexity Calculator implementing the methods we have developed in recent papers at the Algorithmic Nature lab. The OACC provides a comprehensive framework of universal mathematical measures of algorithmic complexity for researchers and professionals. It retrieves objective numerical measures of randomness for potential applications [...]

In a new paper I’ve coauthored with Jean-Paul Delahaye, we propose a test based on the theory of algorithmic complexity and an experimental evaluation of Levin’s universal distribution to identify evidence in support of or in contravention of the claim that the world is algorithmic in nature. To this end we have undertaken a statistical [...] <http://feeds.feedburner.com/~ff/AnimaExMachina?a=5aF13TTJk0g:3NyDdtXOLJ4:yIl2AUoC8zA><http://feeds.feedburner.com/~ff/AnimaExMachina?a=5aF13TTJk0g:3NyDdtX

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__

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 […]

Computing the incomputable has always been a challenge. For example, in finding the busiest Turing machines (Rado) given a number of symbols and states (whimsically called busy beavers). This means either finding Turing machines that, starting from an empty input, produce more non-blank symbols in their output tapes before halting than any other Turing machine [...]

I was awarded a 3rd Place Prize in this year’s FQXi contest Is Reality Digital or Analog? by the Foundational Questions Institute for my work entitled The World is Either Algorithmic or Mostly Random. The winners were announced at this year’s World Science Festival in New York City. Based on the combined ratings of the [...] <http://feeds.feedburner.com/~ff/AnimaExMachina?a=aaTeyxGfHHU:prN5fYNxsGY:yIl2AUoC8zA><http://feeds.feedburner.com/~ff/AnimaExMachina?a=aaTeyxGfHHU:prN5fYNxsGY:dnMXMwOfBR0><

We present a method for estimating the complexity of an image based on the concept of Bennett's logical depth. We use this measure to classify images by their information content. The method provides a means for evaluating and classifying objects by way of their visual representations. <http://feeds.feedburner.com/~ff/AnimaExMachina?a=IW9tuhKc3ew:FZL33B1SA0s:yIl2AUoC8zA><http://feeds.feedburner.com/~ff/AnimaExMachina?a=IW9tuhKc3ew:FZL33B1SA0s:dnMXMwOfBR0><http://feeds.feedburner.com/~ff/AnimaExM

One of the greatest scientific achievements of the last century was the understanding of life in terms of information. We know today that the information for synthesizing the molecules that allow organisms to survive and replicate is encoded in the DNA. In the cell, DNA is copied to messenger RNA, and triplet codons in the [...] <http://feeds.feedburner.com/~ff/AnimaExMachina?a=SdY14MedKyQ:FhWqPCt-sRQ:yIl2AUoC8zA><http://feeds.feedburner.com/~ff/AnimaExMachina?a=SdY14MedKyQ:FhWqPCt-sRQ:dnMXMwOfB

======================================== The Shortest Universal Turing Machine Implementation Contest ANNOUNCEMENT 23 Dec – 2008 http://www.mathrix.org/experimentalAIT/TuringMachine.html ======================================== Contest Overview ============ In the spirit of the busy beaver competition though related to program-size complexity, we are pleased to announce the “Shortest Universal [...] <http://feeds.feedburner.com/~ff/AnimaExMachina?a=gv22a5CUWXQ:xCxFzzQEhHk:yIl2AUoC8zA><http://fee

A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown that the compression-based approach classifies cellular automata (CA) into clusters according to their heuristic behavior, with these clusters showing a correspondence with Wolfram's main classes of CA behavior. A Gray code-based numbering scheme for initial conditions and a c